{"published":"2014-08-09 22:33:47","author_url":"https://blog.hatena.ne.jp/blue_jam/","provider_url":"https://hatena.blog","title":"POJ 3259: Wormholes","url":"https://blue-jam.hatenablog.com/entry/2014/08/09/223347","blog_url":"https://blue-jam.hatenablog.com/","type":"rich","blog_title":"blue_jam\u306e\u65e5\u8a18","version":"1.0","author_name":"blue_jam","categories":["\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0"],"description":"\u87fb\u672c\u306e\u554f\u984c\u756a\u53f7\u3068\uff0c\u554f\u984c\u540d\u306e\u5bfe\u5fdc\u304c\u9593\u9055\u3063\u3066\u305f\uff0e \u6982\u8981 \u8ca0\u9589\u8def\u691c\u77e5\u3084\u308b\u3060\u3051\uff0e const int INF = 100000000; typedef int Weight; struct Edge{ int from, to; Weight weight; Edge(int f, int t, Weight w) : from(f), to(t), weight(w) { } }; typedef vector<Edge> Edges; typedef vector<Edges> Graph; bool findNegativeRoop(const Graph &g){ int n = g.size\u2026","provider_name":"Hatena Blog","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblue-jam.hatenablog.com%2Fentry%2F2014%2F08%2F09%2F223347\" title=\"POJ 3259: Wormholes - blue_jam\u306e\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","image_url":null}