結果
問題 | No.1344 Typical Shortest Path Sum |
ユーザー | さかぽん |
提出日時 | 2021-01-16 13:32:51 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 1,450 bytes |
コンパイル時間 | 2,222 ms |
コンパイル使用メモリ | 109,184 KB |
実行使用メモリ | 19,968 KB |
最終ジャッジ日時 | 2024-05-05 15:32:34 |
合計ジャッジ時間 | 5,009 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
19,584 KB |
testcase_01 | AC | 28 ms
19,456 KB |
testcase_02 | AC | 28 ms
19,456 KB |
testcase_03 | AC | 29 ms
19,328 KB |
testcase_04 | AC | 31 ms
19,200 KB |
testcase_05 | AC | 30 ms
19,200 KB |
testcase_06 | AC | 29 ms
19,200 KB |
testcase_07 | AC | 29 ms
19,328 KB |
testcase_08 | AC | 29 ms
19,328 KB |
testcase_09 | AC | 29 ms
19,200 KB |
testcase_10 | AC | 32 ms
19,456 KB |
testcase_11 | AC | 32 ms
19,456 KB |
testcase_12 | AC | 31 ms
19,328 KB |
testcase_13 | AC | 31 ms
19,328 KB |
testcase_14 | AC | 31 ms
19,200 KB |
testcase_15 | AC | 30 ms
19,200 KB |
testcase_16 | AC | 30 ms
19,328 KB |
testcase_17 | AC | 30 ms
19,456 KB |
testcase_18 | AC | 34 ms
19,328 KB |
testcase_19 | AC | 30 ms
19,200 KB |
testcase_20 | AC | 29 ms
19,200 KB |
testcase_21 | AC | 29 ms
19,328 KB |
testcase_22 | AC | 27 ms
19,584 KB |
testcase_23 | AC | 28 ms
19,328 KB |
testcase_24 | AC | 31 ms
19,328 KB |
testcase_25 | AC | 30 ms
19,200 KB |
testcase_26 | AC | 32 ms
19,328 KB |
testcase_27 | AC | 31 ms
19,200 KB |
testcase_28 | AC | 30 ms
19,200 KB |
testcase_29 | AC | 29 ms
19,328 KB |
testcase_30 | AC | 29 ms
19,456 KB |
testcase_31 | AC | 29 ms
19,200 KB |
testcase_32 | AC | 28 ms
19,456 KB |
testcase_33 | AC | 28 ms
19,584 KB |
testcase_34 | AC | 28 ms
19,200 KB |
testcase_35 | AC | 27 ms
19,456 KB |
testcase_36 | AC | 27 ms
19,072 KB |
testcase_37 | AC | 28 ms
19,456 KB |
testcase_38 | AC | 29 ms
19,328 KB |
testcase_39 | AC | 29 ms
19,328 KB |
testcase_40 | AC | 30 ms
19,584 KB |
testcase_41 | AC | 30 ms
19,712 KB |
testcase_42 | AC | 31 ms
19,584 KB |
testcase_43 | AC | 31 ms
19,712 KB |
testcase_44 | AC | 31 ms
19,456 KB |
testcase_45 | AC | 31 ms
19,584 KB |
testcase_46 | AC | 30 ms
19,328 KB |
testcase_47 | AC | 32 ms
19,200 KB |
testcase_48 | AC | 31 ms
19,584 KB |
testcase_49 | AC | 31 ms
19,584 KB |
testcase_50 | AC | 32 ms
19,584 KB |
testcase_51 | AC | 30 ms
19,584 KB |
testcase_52 | AC | 31 ms
19,584 KB |
testcase_53 | AC | 32 ms
19,712 KB |
testcase_54 | AC | 31 ms
19,584 KB |
testcase_55 | AC | 32 ms
19,328 KB |
testcase_56 | AC | 31 ms
19,712 KB |
testcase_57 | AC | 30 ms
19,584 KB |
testcase_58 | AC | 30 ms
19,712 KB |
testcase_59 | AC | 30 ms
19,712 KB |
testcase_60 | AC | 30 ms
19,072 KB |
testcase_61 | AC | 29 ms
19,456 KB |
testcase_62 | AC | 31 ms
19,712 KB |
testcase_63 | AC | 30 ms
19,584 KB |
testcase_64 | AC | 30 ms
19,456 KB |
testcase_65 | AC | 32 ms
19,840 KB |
testcase_66 | AC | 33 ms
19,712 KB |
testcase_67 | AC | 32 ms
19,968 KB |
testcase_68 | AC | 29 ms
19,456 KB |
testcase_69 | AC | 29 ms
19,712 KB |
testcase_70 | AC | 31 ms
19,456 KB |
testcase_71 | AC | 29 ms
19,456 KB |
testcase_72 | AC | 30 ms
19,328 KB |
testcase_73 | AC | 32 ms
19,328 KB |
testcase_74 | AC | 30 ms
19,584 KB |
testcase_75 | AC | 31 ms
19,200 KB |
testcase_76 | AC | 30 ms
19,200 KB |
testcase_77 | AC | 31 ms
19,200 KB |
testcase_78 | AC | 31 ms
19,584 KB |
testcase_79 | AC | 31 ms
19,328 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Linq; class C { static int[] Read() => Array.ConvertAll(Console.ReadLine().Split(), int.Parse); static (int, int) Read2() { var a = Read(); return (a[0], a[1]); } static long[] ReadL() => Array.ConvertAll(Console.ReadLine().Split(), long.Parse); static void Main() { var (n, m) = Read2(); var es = Array.ConvertAll(new bool[m], _ => ReadL()); var r = WarshallFloyd(n + 1, es, true).Item1; Console.WriteLine(string.Join("\n", r.Skip(1).Select(vs => vs.Where(v => v != long.MaxValue).Sum()))); } public static Tuple<long[][], int[][]> WarshallFloyd(int n, long[][] es, bool directed) { var cs = Array.ConvertAll(new bool[n], i => Array.ConvertAll(new bool[n], _ => long.MaxValue)); var inters = Array.ConvertAll(new bool[n], i => Array.ConvertAll(new bool[n], _ => -1)); for (int i = 0; i < n; ++i) cs[i][i] = 0; foreach (var e in es) { cs[e[0]][e[1]] = Math.Min(cs[e[0]][e[1]], e[2]); if (!directed) cs[e[1]][e[0]] = Math.Min(cs[e[1]][e[0]], e[2]); } for (int k = 0; k < n; ++k) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) { if (cs[i][k] == long.MaxValue || cs[k][j] == long.MaxValue) continue; var nc = cs[i][k] + cs[k][j]; if (cs[i][j] <= nc) continue; cs[i][j] = nc; inters[i][j] = k; } for (int i = 0; i < n; ++i) if (cs[i][i] < 0) return Tuple.Create<long[][], int[][]>(null, null); return Tuple.Create(cs, inters); } }