結果
問題 | No.2569 はじめてのおつかいHard |
ユーザー | tenten |
提出日時 | 2023-12-04 18:34:34 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,405 ms / 2,000 ms |
コード長 | 4,250 bytes |
コンパイル時間 | 3,903 ms |
コンパイル使用メモリ | 93,772 KB |
実行使用メモリ | 117,644 KB |
最終ジャッジ日時 | 2023-12-04 18:34:53 |
合計ジャッジ時間 | 18,564 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 961 ms
80,896 KB |
testcase_01 | AC | 912 ms
81,324 KB |
testcase_02 | AC | 870 ms
81,612 KB |
testcase_03 | AC | 850 ms
81,560 KB |
testcase_04 | AC | 890 ms
81,600 KB |
testcase_05 | AC | 1,246 ms
107,608 KB |
testcase_06 | AC | 1,405 ms
93,188 KB |
testcase_07 | AC | 1,306 ms
117,644 KB |
testcase_08 | AC | 1,106 ms
107,300 KB |
testcase_09 | AC | 1,226 ms
96,408 KB |
testcase_10 | AC | 67 ms
54,904 KB |
testcase_11 | AC | 67 ms
52,916 KB |
ソースコード
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(); ArrayList<ArrayList<Path>> graph = new ArrayList<>(); ArrayList<ArrayList<Path>> reverse = new ArrayList<>(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); reverse.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)); reverse.get(b).add(new Path(a, c)); } PriorityQueue<Path> queue = new PriorityQueue<>(); int[] starts = new int[]{n - 2, n - 1}; long[][] costs = new long[2][n]; for (int i = 0; i < 2; i++) { Arrays.fill(costs[i], Long.MAX_VALUE / 3); queue.add(new Path(starts[i], 0)); while (queue.size() > 0) { Path p = queue.poll(); if (costs[i][p.idx] <= p.value) { continue; } costs[i][p.idx] = p.value; for (Path x : graph.get(p.idx)) { queue.add(new Path(x.idx, p.value + x.value)); } } } long[][] rcosts = new long[2][n]; for (int i = 0; i < 2; i++) { Arrays.fill(rcosts[i], Long.MAX_VALUE / 3); queue.add(new Path(starts[i], 0)); while (queue.size() > 0) { Path p = queue.poll(); if (rcosts[i][p.idx] <= p.value) { continue; } rcosts[i][p.idx] = p.value; for (Path x : reverse.get(p.idx)) { queue.add(new Path(x.idx, p.value + x.value)); } } } long[] ans = new long[n - 2]; for (int i = 0; i < n - 2; i++) { long strait = rcosts[0][i] + costs[0][n - 1] + costs[1][i]; long updown = rcosts[1][i] + costs[1][n - 2] + costs[0][i]; long tmp = Math.min(strait, updown); if (tmp >= Long.MAX_VALUE / 3) { ans[i] = -1; } else { ans[i] = tmp; } } System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new))); } static class Path implements Comparable<Path> { int idx; long value; public Path(int idx, long value) { this.idx = idx; this.value = value; } public int compareTo(Path another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } } 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(); } }