<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>rokugats</author_name>
  <author_url>https://blog.hatena.ne.jp/rokugats/</author_url>
  <blog_title>ICPC log</blog_title>
  <blog_url>https://rokugats-pc.hateblo.jp/</blog_url>
  <categories>
    <anon>POJ</anon>
    <anon>フロー</anon>
    <anon>最大流・最小カット</anon>
    <anon>蟻本</anon>
  </categories>
  <description>蟻本の例題。最大流問題。 解説は蟻本に載ってるので省略。そのうち自分で書くかも。 #include&lt;cstdio&gt; #include&lt;cstring&gt; #include&lt;vector&gt; #define INF 1000000000 #define MAX_V 405 using namespace std; struct edge { int to, cap, rev_index; }; vector&lt;edge&gt; G[MAX_V]; bool used[MAX_V]; void add_edge(int from, int to){ G[from].push_back((edge){to, 1…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Frokugats-pc.hateblo.jp%2Fentry%2F2014%2F02%2F22%2F054537&quot; title=&quot;PKU POJ 3281 Dining - ICPC log&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></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2014-02-22 05:45:37</published>
  <title>PKU POJ 3281 Dining</title>
  <type>rich</type>
  <url>https://rokugats-pc.hateblo.jp/entry/2014/02/22/054537</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
