結果
問題 | No.1576 織姫と彦星 |
ユーザー | tenten |
提出日時 | 2023-02-21 09:33:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 3,106 bytes |
コンパイル時間 | 5,250 ms |
コンパイル使用メモリ | 90,712 KB |
実行使用メモリ | 53,232 KB |
最終ジャッジ日時 | 2023-09-29 03:57:08 |
合計ジャッジ時間 | 10,892 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,528 KB |
testcase_01 | AC | 47 ms
49,584 KB |
testcase_02 | AC | 47 ms
49,476 KB |
testcase_03 | AC | 47 ms
49,724 KB |
testcase_04 | AC | 46 ms
49,540 KB |
testcase_05 | AC | 47 ms
49,532 KB |
testcase_06 | AC | 48 ms
47,616 KB |
testcase_07 | AC | 80 ms
52,580 KB |
testcase_08 | AC | 70 ms
50,360 KB |
testcase_09 | AC | 50 ms
49,632 KB |
testcase_10 | AC | 102 ms
52,476 KB |
testcase_11 | AC | 50 ms
49,596 KB |
testcase_12 | AC | 94 ms
52,728 KB |
testcase_13 | AC | 108 ms
52,704 KB |
testcase_14 | AC | 98 ms
52,596 KB |
testcase_15 | AC | 98 ms
52,604 KB |
testcase_16 | AC | 96 ms
52,736 KB |
testcase_17 | AC | 97 ms
52,492 KB |
testcase_18 | AC | 61 ms
50,860 KB |
testcase_19 | AC | 71 ms
51,796 KB |
testcase_20 | AC | 90 ms
52,632 KB |
testcase_21 | AC | 95 ms
52,560 KB |
testcase_22 | AC | 95 ms
52,324 KB |
testcase_23 | AC | 60 ms
50,636 KB |
testcase_24 | AC | 63 ms
50,964 KB |
testcase_25 | AC | 100 ms
52,792 KB |
testcase_26 | AC | 84 ms
52,140 KB |
testcase_27 | AC | 52 ms
49,708 KB |
testcase_28 | AC | 100 ms
52,852 KB |
testcase_29 | AC | 85 ms
52,144 KB |
testcase_30 | AC | 48 ms
49,636 KB |
testcase_31 | AC | 77 ms
51,856 KB |
testcase_32 | AC | 94 ms
52,952 KB |
testcase_33 | AC | 111 ms
53,020 KB |
testcase_34 | AC | 51 ms
49,692 KB |
testcase_35 | AC | 84 ms
52,656 KB |
testcase_36 | AC | 61 ms
50,024 KB |
testcase_37 | AC | 112 ms
52,756 KB |
testcase_38 | AC | 102 ms
52,768 KB |
testcase_39 | AC | 79 ms
51,040 KB |
testcase_40 | AC | 86 ms
52,588 KB |
testcase_41 | AC | 84 ms
52,604 KB |
testcase_42 | AC | 54 ms
49,616 KB |
testcase_43 | AC | 62 ms
51,084 KB |
testcase_44 | AC | 115 ms
53,092 KB |
testcase_45 | AC | 74 ms
52,700 KB |
testcase_46 | AC | 104 ms
52,812 KB |
testcase_47 | AC | 60 ms
51,068 KB |
testcase_48 | AC | 80 ms
52,252 KB |
testcase_49 | AC | 78 ms
51,236 KB |
testcase_50 | AC | 52 ms
49,604 KB |
testcase_51 | AC | 60 ms
50,836 KB |
testcase_52 | AC | 105 ms
52,520 KB |
testcase_53 | AC | 100 ms
53,232 KB |
testcase_54 | AC | 105 ms
52,768 KB |
testcase_55 | AC | 110 ms
52,604 KB |
testcase_56 | AC | 114 ms
52,988 KB |
testcase_57 | AC | 50 ms
49,492 KB |
testcase_58 | AC | 70 ms
52,468 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[] values = new int[n + 2]; ArrayList<ArrayList<Integer>> graph = new ArrayList<>(); for (int i = 0; i < n + 2; i++) { values[i] = sc.nextInt(); graph.add(new ArrayList<>()); } for (int i = 0; i < n + 2; i++) { for (int j = i + 1; j < n + 2; j++) { if (getPop(values[i] ^ values[j]) <= 1) { graph.get(i).add(j); graph.get(j).add(i); } } } PriorityQueue<Path> queue = new PriorityQueue<>(); int[] costs = new int[n + 2]; Arrays.fill(costs, Integer.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 (int x : graph.get(p.idx)) { queue.add(new Path(x, p.value + 1)); } } if (costs[1] == Integer.MAX_VALUE) { System.out.println(-1); } else { System.out.println(costs[1] - 1); } } static int getPop(int x) { int pop = 0; while (x > 0) { pop += x % 2; x >>= 1; } return pop; } 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(); } }