nodchip https://blog.hatena.ne.jp/nodchip/ nodchipの日記 https://nodchip.hatenadiary.org/ 全点間最短距離 ダイクストラ法またはワーシャルフロイド法が使える static int g[128][128]; int main() { for (int N; cin >> N && N; ) { fill_n((int*)g, sizeof(g) / sizeof(g[0][0]), INT_MAX / 2); for (int n = 1; n <= N; ++n) { int M; cin >> M; for (int m = 0; m < M; ++m) { int to, cost; cin >> to >> cost; g[n][to] = cost; } } for (int… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnodchip.hatenadiary.org%2Fentry%2F20100514%2F1273798902" title="PKU 1125 Stockbroker Grapevine - nodchipの日記" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2010-05-14 10:01:42 rich https://nodchip.hatenadiary.org/entry/20100514/1273798902 1.0 100%