結果
問題 | No.1480 Many Complete Graphs |
ユーザー | tenten |
提出日時 | 2022-09-02 18:54:10 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 695 ms / 2,000 ms |
コード長 | 2,786 bytes |
コンパイル時間 | 2,375 ms |
コンパイル使用メモリ | 78,572 KB |
実行使用メモリ | 80,864 KB |
最終ジャッジ日時 | 2024-11-15 23:32:17 |
合計ジャッジ時間 | 31,394 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,960 KB |
testcase_01 | AC | 52 ms
37,176 KB |
testcase_02 | AC | 52 ms
37,056 KB |
testcase_03 | AC | 51 ms
36,848 KB |
testcase_04 | AC | 52 ms
36,960 KB |
testcase_05 | AC | 52 ms
37,204 KB |
testcase_06 | AC | 52 ms
37,232 KB |
testcase_07 | AC | 53 ms
37,000 KB |
testcase_08 | AC | 55 ms
37,076 KB |
testcase_09 | AC | 89 ms
39,152 KB |
testcase_10 | AC | 94 ms
39,080 KB |
testcase_11 | AC | 67 ms
37,576 KB |
testcase_12 | AC | 71 ms
37,736 KB |
testcase_13 | AC | 195 ms
49,568 KB |
testcase_14 | AC | 169 ms
46,792 KB |
testcase_15 | AC | 345 ms
53,480 KB |
testcase_16 | AC | 265 ms
51,024 KB |
testcase_17 | AC | 288 ms
51,196 KB |
testcase_18 | AC | 152 ms
45,648 KB |
testcase_19 | AC | 261 ms
51,160 KB |
testcase_20 | AC | 343 ms
52,708 KB |
testcase_21 | AC | 199 ms
50,032 KB |
testcase_22 | AC | 163 ms
46,136 KB |
testcase_23 | AC | 318 ms
56,324 KB |
testcase_24 | AC | 486 ms
57,316 KB |
testcase_25 | AC | 543 ms
61,588 KB |
testcase_26 | AC | 525 ms
62,384 KB |
testcase_27 | AC | 496 ms
57,252 KB |
testcase_28 | AC | 541 ms
66,364 KB |
testcase_29 | AC | 551 ms
69,148 KB |
testcase_30 | AC | 540 ms
66,316 KB |
testcase_31 | AC | 546 ms
66,480 KB |
testcase_32 | AC | 540 ms
66,512 KB |
testcase_33 | AC | 524 ms
66,280 KB |
testcase_34 | AC | 527 ms
66,312 KB |
testcase_35 | AC | 539 ms
66,552 KB |
testcase_36 | AC | 529 ms
66,308 KB |
testcase_37 | AC | 529 ms
66,336 KB |
testcase_38 | AC | 547 ms
69,172 KB |
testcase_39 | AC | 526 ms
67,208 KB |
testcase_40 | AC | 541 ms
66,496 KB |
testcase_41 | AC | 524 ms
66,128 KB |
testcase_42 | AC | 551 ms
68,864 KB |
testcase_43 | AC | 527 ms
66,412 KB |
testcase_44 | AC | 536 ms
66,616 KB |
testcase_45 | AC | 527 ms
66,452 KB |
testcase_46 | AC | 542 ms
66,576 KB |
testcase_47 | AC | 667 ms
75,244 KB |
testcase_48 | AC | 680 ms
71,032 KB |
testcase_49 | AC | 692 ms
71,164 KB |
testcase_50 | AC | 412 ms
75,832 KB |
testcase_51 | AC | 689 ms
80,864 KB |
testcase_52 | AC | 642 ms
72,224 KB |
testcase_53 | AC | 666 ms
72,376 KB |
testcase_54 | AC | 638 ms
68,656 KB |
testcase_55 | AC | 695 ms
69,120 KB |
testcase_56 | AC | 649 ms
68,852 KB |
testcase_57 | AC | 504 ms
76,104 KB |
testcase_58 | AC | 556 ms
78,528 KB |
evil_aftercontest.txt | AC | 1,009 ms
98,212 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); ArrayList<ArrayList<Path>> graph = new ArrayList<>(); for (int i = 0; i < n + m * 2; i++) { graph.add(new ArrayList<>()); } for (int i = 0; i < m; i++) { int k = sc.nextInt(); int c = sc.nextInt(); for (int j = 0; j < k; j++) { int x = sc.nextInt() - 1; int idx = n + i * 2 + x % 2; graph.get(x).add(new Path(idx, c + x + 1)); graph.get(idx).add(new Path(x, c + x + 1)); } graph.get(n + i * 2).add(new Path(n + i * 2 + 1, 1)); graph.get(n + i * 2 + 1).add(new Path(n + i * 2, 1)); } long[] costs = new long[n + m * 2]; PriorityQueue<Path> queue = new PriorityQueue<>(); Arrays.fill(costs, Long.MAX_VALUE); queue.add(new Path(0, 0)); 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, p.value + x.value)); } } if (costs[n - 1] == Long.MAX_VALUE) { System.out.println(-1); } else { System.out.println(costs[n - 1] / 2); } } 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 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 String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }