{"title":" MMA CTF 2015 - Task Perfect Matching","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fdakutenpura.hatenablog.com%2Fentry%2F2015%2F09%2F07%2F214418\" title=\" MMA CTF 2015 - Task Perfect Matching - A box of chocolate\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"A box of chocolate","image_url":"http://chart.apis.google.com/chart?cht=tx&chl=%7B%20%5Cdisplaystyle%20O%28%20%7CV%7C%5E4%20%29%7D","type":"rich","categories":["Writeup"],"published":"2015-09-07 21:44:18","provider_name":"Hatena Blog","version":"1.0","description":"When I read this problem, I was thinking about Edmonds' algorithm, but it runs in , which is not OK for the last 10 tests. Besides, in graph_generator.py, there are no conditions that guarantee there exists a perfect matching. So, we can't solve this problem that way (or maybe we can, I haven't trie\u2026","author_name":"dakutenpura","blog_url":"https://dakutenpura.hatenablog.com/","width":"100%","author_url":"https://blog.hatena.ne.jp/dakutenpura/","height":"190","url":"https://dakutenpura.hatenablog.com/entry/2015/09/07/214418","provider_url":"https://hatena.blog"}