結果
問題 | No.848 なかよし旅行 |
ユーザー | hiromi_ayase |
提出日時 | 2019-07-05 22:44:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 644 ms / 2,000 ms |
コード長 | 4,650 bytes |
コンパイル時間 | 2,542 ms |
コンパイル使用メモリ | 90,316 KB |
実行使用メモリ | 65,976 KB |
最終ジャッジ日時 | 2024-04-25 13:50:32 |
合計ジャッジ時間 | 11,937 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 644 ms
65,712 KB |
testcase_01 | AC | 89 ms
51,432 KB |
testcase_02 | AC | 78 ms
51,332 KB |
testcase_03 | AC | 80 ms
51,268 KB |
testcase_04 | AC | 81 ms
51,308 KB |
testcase_05 | AC | 80 ms
51,388 KB |
testcase_06 | AC | 95 ms
51,688 KB |
testcase_07 | AC | 84 ms
51,416 KB |
testcase_08 | AC | 120 ms
52,996 KB |
testcase_09 | AC | 144 ms
53,328 KB |
testcase_10 | AC | 125 ms
53,004 KB |
testcase_11 | AC | 375 ms
58,844 KB |
testcase_12 | AC | 405 ms
59,724 KB |
testcase_13 | AC | 405 ms
61,412 KB |
testcase_14 | AC | 327 ms
59,184 KB |
testcase_15 | AC | 394 ms
59,828 KB |
testcase_16 | AC | 572 ms
63,764 KB |
testcase_17 | AC | 451 ms
61,740 KB |
testcase_18 | AC | 373 ms
58,980 KB |
testcase_19 | AC | 380 ms
59,204 KB |
testcase_20 | AC | 216 ms
55,944 KB |
testcase_21 | AC | 523 ms
64,320 KB |
testcase_22 | AC | 435 ms
63,696 KB |
testcase_23 | AC | 183 ms
52,984 KB |
testcase_24 | AC | 77 ms
51,312 KB |
testcase_25 | AC | 587 ms
65,976 KB |
testcase_26 | AC | 78 ms
51,156 KB |
testcase_27 | AC | 78 ms
51,180 KB |
testcase_28 | AC | 77 ms
51,024 KB |
testcase_29 | AC | 79 ms
51,356 KB |
ソースコード
import java.util.Arrays; import java.util.Comparator; import java.util.TreeSet; public class Main { private static void solve() { int n = ni(); int m = ni(); int p = ni() - 1; int q = ni() - 1; int t = ni(); int[] from = new int[m]; int[] to = new int[m]; int[] w = new int[m]; for (int i = 0; i < m; i++) { from[i] = ni() - 1; to[i] = ni() - 1; w[i] = ni(); } int[][][] g = packWU(n, from, to, w); long[] ds = dijk(g, 0); long[] dp = dijk(g, p); long[] dq = dijk(g, q); if (ds[p] + dp[q] + dq[0] <= t) { System.out.println(t); return; } long ret = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { long total = ds[i] + ds[j] + Math.max(dp[i] + dp[j], dq[i] + dq[j]); if (total > t) continue; long now = t - Math.max(dp[i] + dp[j], dq[i] + dq[j]); if (now > ret) { ret = now; } } } System.out.println(ret); } public static long[] dijk(int[][][] g, int from) { int n = g.length; final long[] td = new long[n]; Arrays.fill(td, Long.MAX_VALUE); TreeSet<Integer> q = new TreeSet<Integer>(new Comparator<Integer>() { public int compare(Integer a, Integer b) { if (td[a] - td[b] != 0) return Long.signum(td[a] - td[b]); return a - b; } }); q.add(from); td[from] = 0; while (q.size() > 0) { int cur = q.pollFirst(); for (int i = 0; i < g[cur].length; i++) { int next = g[cur][i][0]; long nd = td[cur] + g[cur][i][1]; if (nd < td[next]) { q.remove(next); td[next] = nd; q.add(next); } } } return td; } public static int[][][] packWU(int n, int[] from, int[] to, int[] w) { int[][][] g = new int[n][][]; int[] p = new int[n]; for (int f : from) p[f]++; for (int t : to) p[t]++; for (int i = 0; i < n; i++) g[i] = new int[p[i]][2]; for (int i = 0; i < from.length; i++) { --p[from[i]]; g[from[i]][p[from[i]]][0] = to[i]; g[from[i]][p[from[i]]][1] = w[i]; --p[to[i]]; g[to[i]][p[to[i]]][0] = from[i]; g[to[i]][p[to[i]]][1] = w[i]; } return g; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }