結果
問題 | No.848 なかよし旅行 |
ユーザー | tenten |
提出日時 | 2023-04-24 15:53:32 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,582 bytes |
コンパイル時間 | 2,653 ms |
コンパイル使用メモリ | 96,428 KB |
実行使用メモリ | 64,752 KB |
最終ジャッジ日時 | 2024-04-26 04:35:47 |
合計ジャッジ時間 | 14,301 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 784 ms
64,356 KB |
testcase_01 | AC | 59 ms
36,924 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 57 ms
36,948 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 59 ms
37,072 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 626 ms
54,176 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 157 ms
41,184 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 59 ms
37,088 KB |
testcase_25 | WA | - |
testcase_26 | AC | 57 ms
37,464 KB |
testcase_27 | AC | 57 ms
37,292 KB |
testcase_28 | AC | 58 ms
36,960 KB |
testcase_29 | AC | 59 ms
37,464 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(); int[] bases = new int[]{0, sc.nextInt() - 1, sc.nextInt() - 1}; int t = 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)); graph.get(b).add(new Path(a, c)); } long[][] costs = new long[3][n]; PriorityQueue<Path> queue = new PriorityQueue<>(); for (int i = 0; i < 3; i++) { queue.add(new Path(bases[i], 0)); Arrays.fill(costs[i], Long.MAX_VALUE); 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, x.value + p.value)); } } } long tmp = 0; for (int i = 0; i < 3; i++) { tmp += costs[i][bases[(i + 1) % 3]]; } if (tmp <= t) { System.out.println(t); return; } long ans = -1; for (int i = 0; i < n; i++) { long separate = Math.max(costs[1][i], costs[2][i]); if (t >= separate * 2 + costs[0][i] * 2) { ans = Math.max(ans, t - separate * 2); } } System.out.println(ans); } 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(); } }