結果
問題 | No.807 umg tours |
ユーザー | tenten |
提出日時 | 2022-10-20 15:47:21 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,767 ms / 4,000 ms |
コード長 | 2,833 bytes |
コンパイル時間 | 5,576 ms |
コンパイル使用メモリ | 74,708 KB |
実行使用メモリ | 122,944 KB |
最終ジャッジ日時 | 2023-09-12 20:53:53 |
合計ジャッジ時間 | 24,619 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
51,476 KB |
testcase_01 | AC | 68 ms
50,928 KB |
testcase_02 | AC | 83 ms
52,040 KB |
testcase_03 | AC | 82 ms
52,156 KB |
testcase_04 | AC | 63 ms
50,484 KB |
testcase_05 | AC | 81 ms
48,852 KB |
testcase_06 | AC | 84 ms
52,444 KB |
testcase_07 | AC | 82 ms
52,076 KB |
testcase_08 | AC | 48 ms
49,652 KB |
testcase_09 | AC | 52 ms
50,116 KB |
testcase_10 | AC | 55 ms
49,760 KB |
testcase_11 | AC | 1,471 ms
104,248 KB |
testcase_12 | AC | 1,157 ms
93,336 KB |
testcase_13 | AC | 1,517 ms
109,264 KB |
testcase_14 | AC | 756 ms
79,556 KB |
testcase_15 | AC | 645 ms
74,236 KB |
testcase_16 | AC | 1,679 ms
112,336 KB |
testcase_17 | AC | 1,767 ms
122,380 KB |
testcase_18 | AC | 1,702 ms
122,944 KB |
testcase_19 | AC | 1,740 ms
120,476 KB |
testcase_20 | AC | 1,123 ms
89,284 KB |
testcase_21 | AC | 1,037 ms
88,120 KB |
testcase_22 | AC | 566 ms
65,712 KB |
testcase_23 | AC | 497 ms
65,880 KB |
testcase_24 | AC | 1,346 ms
116,904 KB |
testcase_25 | AC | 1,713 ms
122,792 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); ArrayList<ArrayList<Path>> graph = new ArrayList<>(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); } for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; int c = sc.nextInt(); graph.get(a).add(new Path(b, c, 0)); graph.get(b).add(new Path(a, c, 0)); } PriorityQueue<Path> queue = new PriorityQueue<>(); queue.add(new Path(0, 0, 1)); queue.add(new Path(0, 0, 0)); long[][] costs = new long[n][2]; for (long[] arr : costs) { Arrays.fill(arr, Long.MAX_VALUE); } while (queue.size() > 0) { Path p = queue.poll(); if (costs[p.idx][p.type] <= p.value) { continue; } costs[p.idx][p.type] = p.value; for (Path x : graph.get(p.idx)) { queue.add(new Path(x.idx, p.value + x.value, p.type)); if (p.type == 0) { queue.add(new Path(x.idx, p.value, 1)); } } } StringBuilder sb = new StringBuilder(); for (int i = 0; i < n; i++) { sb.append(costs[i][0] + costs[i][1]).append("\n"); } System.out.print(sb); } static class Path implements Comparable<Path> { int idx; long value; int type; public Path(int idx, long value, int type) { this.idx = idx; this.value = value; this.type = type; } public int compareTo(Path another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } } 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 String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }