結果
問題 | No.1607 Kth Maximum Card |
ユーザー | tenten |
提出日時 | 2023-02-03 13:58:40 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 3,393 ms / 3,500 ms |
コード長 | 3,196 bytes |
コンパイル時間 | 3,646 ms |
コンパイル使用メモリ | 87,456 KB |
実行使用メモリ | 104,664 KB |
最終ジャッジ日時 | 2023-09-15 10:20:50 |
合計ジャッジ時間 | 47,879 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,456 KB |
testcase_01 | AC | 44 ms
49,568 KB |
testcase_02 | AC | 46 ms
49,648 KB |
testcase_03 | AC | 46 ms
49,512 KB |
testcase_04 | AC | 45 ms
49,552 KB |
testcase_05 | AC | 44 ms
49,592 KB |
testcase_06 | AC | 44 ms
49,780 KB |
testcase_07 | AC | 44 ms
49,560 KB |
testcase_08 | AC | 3,192 ms
97,564 KB |
testcase_09 | AC | 3,023 ms
89,996 KB |
testcase_10 | AC | 3,393 ms
97,504 KB |
testcase_11 | AC | 910 ms
65,316 KB |
testcase_12 | AC | 2,721 ms
90,988 KB |
testcase_13 | AC | 634 ms
62,844 KB |
testcase_14 | AC | 621 ms
63,368 KB |
testcase_15 | AC | 2,080 ms
92,248 KB |
testcase_16 | AC | 594 ms
63,232 KB |
testcase_17 | AC | 365 ms
59,084 KB |
testcase_18 | AC | 1,227 ms
77,056 KB |
testcase_19 | AC | 905 ms
66,616 KB |
testcase_20 | AC | 1,184 ms
74,468 KB |
testcase_21 | AC | 1,303 ms
74,984 KB |
testcase_22 | AC | 2,015 ms
98,896 KB |
testcase_23 | AC | 2,114 ms
98,656 KB |
testcase_24 | AC | 956 ms
70,208 KB |
testcase_25 | AC | 696 ms
63,412 KB |
testcase_26 | AC | 711 ms
65,504 KB |
testcase_27 | AC | 920 ms
71,636 KB |
testcase_28 | AC | 770 ms
65,464 KB |
testcase_29 | AC | 1,623 ms
79,076 KB |
testcase_30 | AC | 2,503 ms
96,452 KB |
testcase_31 | AC | 1,573 ms
76,264 KB |
testcase_32 | AC | 1,400 ms
102,464 KB |
testcase_33 | AC | 1,361 ms
104,664 KB |
testcase_34 | AC | 1,380 ms
104,392 KB |
testcase_35 | AC | 1,309 ms
104,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 k = 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)); } int left = -1; int right = 200001; int[] costs = new int[n]; PriorityQueue<Path> queue = new PriorityQueue<>(); while (right - left > 1) { int z = (left + right) / 2; queue.add(new Path(0, 0)); Arrays.fill(costs, Integer.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)) { int add = 0; if (x.value > z) { add = 1; } queue.add(new Path(x.idx, p.value + add)); } } if (costs[n - 1] >= k) { left = z; } else { right = z; } } System.out.println(right); } static class Path implements Comparable<Path> { int idx; int value; public Path(int idx, int value) { this.idx = idx; this.value = value; } 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(); } }