結果
問題 | No.2387 Yokan Factory |
ユーザー | tenten |
提出日時 | 2023-07-24 11:15:41 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,285 bytes |
コンパイル時間 | 3,629 ms |
コンパイル使用メモリ | 92,428 KB |
実行使用メモリ | 87,492 KB |
最終ジャッジ日時 | 2024-04-08 13:27:13 |
合計ジャッジ時間 | 27,950 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
52,104 KB |
testcase_01 | AC | 56 ms
54,116 KB |
testcase_02 | AC | 56 ms
54,156 KB |
testcase_03 | AC | 58 ms
54,148 KB |
testcase_04 | AC | 56 ms
54,156 KB |
testcase_05 | AC | 58 ms
54,112 KB |
testcase_06 | AC | 56 ms
52,144 KB |
testcase_07 | AC | 56 ms
54,196 KB |
testcase_08 | AC | 56 ms
54,176 KB |
testcase_09 | AC | 55 ms
54,132 KB |
testcase_10 | AC | 59 ms
54,116 KB |
testcase_11 | AC | 56 ms
54,172 KB |
testcase_12 | AC | 57 ms
54,132 KB |
testcase_13 | AC | 57 ms
54,144 KB |
testcase_14 | AC | 56 ms
54,152 KB |
testcase_15 | AC | 1,127 ms
77,272 KB |
testcase_16 | AC | 782 ms
75,544 KB |
testcase_17 | AC | 1,940 ms
87,492 KB |
testcase_18 | AC | 1,732 ms
79,124 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 2,134 ms
73,964 KB |
testcase_22 | WA | - |
testcase_23 | AC | 3,150 ms
72,196 KB |
testcase_24 | AC | 1,010 ms
69,084 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 140 ms
55,900 KB |
testcase_29 | AC | 161 ms
56,808 KB |
testcase_30 | AC | 155 ms
56,028 KB |
testcase_31 | AC | 139 ms
55,936 KB |
testcase_32 | AC | 119 ms
55,536 KB |
testcase_33 | AC | 117 ms
55,772 KB |
testcase_34 | AC | 153 ms
56,088 KB |
testcase_35 | AC | 158 ms
56,076 KB |
testcase_36 | AC | 114 ms
55,552 KB |
testcase_37 | AC | 56 ms
54,152 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(); long limit = sc.nextLong(); 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(); int d = sc.nextInt(); graph.get(a).add(new Path(b, c, d)); graph.get(b).add(new Path(a, c, d)); } int left = -1; int right = Integer.MAX_VALUE / 2; PriorityQueue<Path> queue = new PriorityQueue<>(); long[] costs = new long[n]; while (right - left > 1) { int mm = (left + right) / 2; queue.add(new Path(0, 0, mm)); Arrays.fill(costs, Long.MAX_VALUE); while (queue.size() > 0) { Path p = queue.poll(); if (costs[p.idx] <= p.value) { continue; } costs[p.idx] = p.value; for (Path x : graph.get(p.idx)) { if (x.width >= p.width) { queue.add(new Path(x.idx, x.value + p.value, p.width)); } } } if (costs[n - 1] > limit) { right = mm; } else { left = mm; } } System.out.println(left); } static class Path implements Comparable<Path> { int idx; int value; int width; public Path(int idx, int value, int width) { this.idx = idx; this.value = value; this.width = width; } public int compareTo(Path another) { return value - another.value; } } } 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(); } }