結果
問題 | No.1576 織姫と彦星 |
ユーザー | tenten |
提出日時 | 2023-02-21 09:33:18 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 114 ms / 2,000 ms |
コード長 | 3,106 bytes |
コンパイル時間 | 5,764 ms |
コンパイル使用メモリ | 84,264 KB |
実行使用メモリ | 39,464 KB |
最終ジャッジ日時 | 2024-07-21 22:31:21 |
合計ジャッジ時間 | 11,912 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,684 KB |
testcase_01 | AC | 50 ms
37,272 KB |
testcase_02 | AC | 52 ms
37,060 KB |
testcase_03 | AC | 51 ms
36,720 KB |
testcase_04 | AC | 54 ms
37,212 KB |
testcase_05 | AC | 51 ms
36,992 KB |
testcase_06 | AC | 52 ms
37,272 KB |
testcase_07 | AC | 79 ms
38,384 KB |
testcase_08 | AC | 76 ms
38,416 KB |
testcase_09 | AC | 53 ms
36,976 KB |
testcase_10 | AC | 97 ms
38,868 KB |
testcase_11 | AC | 53 ms
37,008 KB |
testcase_12 | AC | 92 ms
38,720 KB |
testcase_13 | AC | 100 ms
39,192 KB |
testcase_14 | AC | 99 ms
39,032 KB |
testcase_15 | AC | 99 ms
38,884 KB |
testcase_16 | AC | 98 ms
38,588 KB |
testcase_17 | AC | 98 ms
38,876 KB |
testcase_18 | AC | 71 ms
37,688 KB |
testcase_19 | AC | 85 ms
38,592 KB |
testcase_20 | AC | 90 ms
39,032 KB |
testcase_21 | AC | 96 ms
39,140 KB |
testcase_22 | AC | 95 ms
38,928 KB |
testcase_23 | AC | 65 ms
37,832 KB |
testcase_24 | AC | 67 ms
37,948 KB |
testcase_25 | AC | 99 ms
38,600 KB |
testcase_26 | AC | 91 ms
38,628 KB |
testcase_27 | AC | 55 ms
36,784 KB |
testcase_28 | AC | 98 ms
39,052 KB |
testcase_29 | AC | 89 ms
38,604 KB |
testcase_30 | AC | 51 ms
36,944 KB |
testcase_31 | AC | 89 ms
38,556 KB |
testcase_32 | AC | 97 ms
38,956 KB |
testcase_33 | AC | 106 ms
39,216 KB |
testcase_34 | AC | 54 ms
37,100 KB |
testcase_35 | AC | 91 ms
38,940 KB |
testcase_36 | AC | 66 ms
37,800 KB |
testcase_37 | AC | 112 ms
38,880 KB |
testcase_38 | AC | 98 ms
39,012 KB |
testcase_39 | AC | 93 ms
38,708 KB |
testcase_40 | AC | 93 ms
38,672 KB |
testcase_41 | AC | 83 ms
38,796 KB |
testcase_42 | AC | 58 ms
37,028 KB |
testcase_43 | AC | 71 ms
38,032 KB |
testcase_44 | AC | 114 ms
39,464 KB |
testcase_45 | AC | 81 ms
38,852 KB |
testcase_46 | AC | 99 ms
39,092 KB |
testcase_47 | AC | 66 ms
37,540 KB |
testcase_48 | AC | 92 ms
38,792 KB |
testcase_49 | AC | 93 ms
38,580 KB |
testcase_50 | AC | 52 ms
37,240 KB |
testcase_51 | AC | 63 ms
37,584 KB |
testcase_52 | AC | 99 ms
38,808 KB |
testcase_53 | AC | 100 ms
39,144 KB |
testcase_54 | AC | 99 ms
39,096 KB |
testcase_55 | AC | 109 ms
39,244 KB |
testcase_56 | AC | 111 ms
38,724 KB |
testcase_57 | AC | 53 ms
37,132 KB |
testcase_58 | AC | 75 ms
38,544 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(); } }