<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>dakutenpura</author_name>
  <author_url>https://blog.hatena.ne.jp/dakutenpura/</author_url>
  <blog_title>A box of chocolate</blog_title>
  <blog_url>https://dakutenpura.hatenablog.com/</blog_url>
  <categories>
    <anon>Writeup</anon>
  </categories>
  <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…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fdakutenpura.hatenablog.com%2Fentry%2F2015%2F09%2F07%2F214418&quot; title=&quot; MMA CTF 2015 - Task Perfect Matching - A box of chocolate&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url>http://chart.apis.google.com/chart?cht=tx&amp;chl=%7B%20%5Cdisplaystyle%20O%28%20%7CV%7C%5E4%20%29%7D</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2015-09-07 21:44:18</published>
  <title> MMA CTF 2015 - Task Perfect Matching</title>
  <type>rich</type>
  <url>https://dakutenpura.hatenablog.com/entry/2015/09/07/214418</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
