{"width":"100%","blog_url":"https://logfiles.hatenablog.com/","author_url":"https://blog.hatena.ne.jp/moistx/","image_url":null,"blog_title":"Logfiles","description":"\u554f\u984c http://uva.onlinejudge.org/external/118/11833.html\u6982\u8981\u306f\u539f\u6587\u3092\u78ba\u8a8d\u3057\u3066\u304f\u3060\u3055\u3044\u3002\u89e3\u6cd5 #include <bits/stdc++.h> using namespace std; #define MAX (250) #define INF (1<<29) typedef pair<int, int> Pii; struct Edge { int to, cost; }; vector<Edge> G[MAX]; int dist[MAX]; int N, M, C; int dijkstra(int S, int T) { priority\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140528%2F1401280416\" title=\"UVa11833 Route Change - Logfiles\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","published":"2014-05-28 21:33:36","type":"rich","provider_url":"https://hatena.blog","version":"1.0","url":"https://logfiles.hatenablog.com/entry/20140528/1401280416","categories":["UVa"],"author_name":"moistx","height":"190","title":"UVa11833 Route Change"}