結果
問題 | No.2739 Time is money |
ユーザー | tenten |
提出日時 | 2024-04-22 13:16:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,314 ms / 2,000 ms |
コード長 | 2,520 bytes |
コンパイル時間 | 2,543 ms |
コンパイル使用メモリ | 80,240 KB |
実行使用メモリ | 92,644 KB |
最終ジャッジ日時 | 2024-04-22 13:16:43 |
合計ジャッジ時間 | 25,144 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,504 KB |
testcase_01 | AC | 51 ms
37,148 KB |
testcase_02 | AC | 620 ms
66,024 KB |
testcase_03 | AC | 1,118 ms
75,572 KB |
testcase_04 | AC | 587 ms
65,456 KB |
testcase_05 | AC | 844 ms
66,300 KB |
testcase_06 | AC | 1,135 ms
68,952 KB |
testcase_07 | AC | 1,249 ms
86,396 KB |
testcase_08 | AC | 1,297 ms
86,000 KB |
testcase_09 | AC | 1,180 ms
85,672 KB |
testcase_10 | AC | 830 ms
92,644 KB |
testcase_11 | AC | 1,314 ms
86,688 KB |
testcase_12 | AC | 971 ms
86,712 KB |
testcase_13 | AC | 964 ms
86,624 KB |
testcase_14 | AC | 913 ms
85,344 KB |
testcase_15 | AC | 877 ms
78,444 KB |
testcase_16 | AC | 834 ms
80,812 KB |
testcase_17 | AC | 1,160 ms
85,752 KB |
testcase_18 | AC | 1,161 ms
85,572 KB |
testcase_19 | AC | 992 ms
87,428 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.function.*; 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 rate = sc.nextInt(); List<List<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; long c = sc.nextInt() + sc.nextInt() * rate; graph.get(a).add(new Path(b, c)); graph.get(b).add(new Path(a, c)); } PriorityQueue<Path> queue = new PriorityQueue<>(); queue.add(new Path(0, 0)); long[] costs = new long[n]; 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)) { queue.add(new Path(x.idx, x.value + p.value)); } } System.out.println(costs[n - 1] == Long.MAX_VALUE ? -1 : (costs[n - 1] + rate - 1) / rate); } 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) { return Long.compare(value, another.value); } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }