結果
問題 | No.1344 Typical Shortest Path Sum |
ユーザー | tenten |
提出日時 | 2023-03-23 08:54:07 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,385 bytes |
コンパイル時間 | 2,838 ms |
コンパイル使用メモリ | 92,412 KB |
実行使用メモリ | 53,664 KB |
最終ジャッジ日時 | 2024-09-18 15:19:39 |
合計ジャッジ時間 | 9,899 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
36,972 KB |
testcase_01 | AC | 50 ms
37,444 KB |
testcase_02 | AC | 50 ms
36,852 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 48 ms
37,172 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 51 ms
36,980 KB |
testcase_11 | AC | 49 ms
37,172 KB |
testcase_12 | WA | - |
testcase_13 | AC | 48 ms
37,172 KB |
testcase_14 | WA | - |
testcase_15 | AC | 51 ms
37,292 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 53 ms
36,828 KB |
testcase_21 | WA | - |
testcase_22 | AC | 51 ms
36,736 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 48 ms
37,212 KB |
testcase_26 | WA | - |
testcase_27 | AC | 50 ms
37,080 KB |
testcase_28 | WA | - |
testcase_29 | AC | 49 ms
36,856 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 49 ms
37,228 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 49 ms
37,316 KB |
testcase_36 | AC | 52 ms
37,004 KB |
testcase_37 | WA | - |
testcase_38 | AC | 53 ms
36,952 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 53 ms
37,272 KB |
testcase_61 | AC | 49 ms
37,084 KB |
testcase_62 | AC | 110 ms
39,692 KB |
testcase_63 | AC | 64 ms
37,884 KB |
testcase_64 | AC | 77 ms
38,296 KB |
testcase_65 | AC | 114 ms
40,016 KB |
testcase_66 | AC | 114 ms
39,788 KB |
testcase_67 | AC | 108 ms
39,548 KB |
testcase_68 | AC | 57 ms
37,116 KB |
testcase_69 | AC | 65 ms
37,440 KB |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | AC | 49 ms
37,132 KB |
testcase_73 | AC | 47 ms
37,124 KB |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); long[][] distances = new long[n][n]; for (int i = 0; i < n; i++) { Arrays.fill(distances[i], Long.MAX_VALUE / 2); distances[i][i] = 0; } for (int i = 0; i < m; i++) { distances[sc.nextInt() - 1][sc.nextInt() - 1] = sc.nextLong(); } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { distances[j][k] = Math.min(distances[j][k], distances[j][i] + distances[i][k]); } } } StringBuilder sb = new StringBuilder(); for (long[] arr : distances) { long sum = 0; for (long x : arr) { if (x < Long.MAX_VALUE / 2) { sum += x; } } sb.append(sum).append("\n"); } System.out.print(sb); } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }