{"title":"TopCoder SRM 687 Div1 Medium: AllGraphCuts","blog_title":"\u5b87\u5b99\u30c4\u30a4\u30c3\u30bf\u30e9\u30fcX\u306e\u6182\u9b31","version":"1.0","blog_url":"https://kenkoooo.hatenablog.com/","height":"190","categories":["\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0","SRM"],"type":"rich","description":"\u554f\u984c https://community.topcoder.com/stat?c=problem_statement&pm=14214 \u89e3\u6cd5 Gomory-Hu \u6728\u304c\u4f5c\u308c\u308b\u3053\u3068\u304b\u3089Gomory-Hu \u6728\u304c\u4f5c\u308c\u308b\u3053\u3068\u306f\u660e\u3089\u304b\u3002 kyuridenamida\u5148\u751f\u306e\u30b3\u30fc\u30c9\u3092\u5199\u7d4c\u3057\u305f\u3002 \u30b3\u30fc\u30c9 #include <bits/stdc++.h> using namespace std; struct UnionFind { vector<int> data; UnionFind(int size) : data(size, -1) {} UnionFind(const UnionFind &u) { da\u2026","author_name":"kenkoooo","provider_url":"https://hatena.blog","url":"https://kenkoooo.hatenablog.com/entry/2016/04/08/205040","width":"100%","published":"2016-04-08 20:50:40","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkenkoooo.hatenablog.com%2Fentry%2F2016%2F04%2F08%2F205040\" title=\"TopCoder SRM 687 Div1 Medium: AllGraphCuts - \u5b87\u5b99\u30c4\u30a4\u30c3\u30bf\u30e9\u30fcX\u306e\u6182\u9b31\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"author_url":"https://blog.hatena.ne.jp/kenkoooo/","provider_name":"Hatena Blog"}