結果
問題 | No.1577 織姫と彦星2 |
ユーザー | tenten |
提出日時 | 2023-07-18 17:04:15 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,229 bytes |
コンパイル時間 | 3,021 ms |
コンパイル使用メモリ | 91,680 KB |
実行使用メモリ | 333,504 KB |
最終ジャッジ日時 | 2024-09-18 16:22:37 |
合計ジャッジ時間 | 13,511 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
50,532 KB |
testcase_01 | AC | 60 ms
50,140 KB |
testcase_02 | AC | 59 ms
50,140 KB |
testcase_03 | AC | 60 ms
50,464 KB |
testcase_04 | AC | 58 ms
50,300 KB |
testcase_05 | AC | 941 ms
127,024 KB |
testcase_06 | AC | 364 ms
79,072 KB |
testcase_07 | TLE | - |
testcase_08 | AC | 1,049 ms
127,928 KB |
testcase_09 | TLE | - |
testcase_10 | AC | 1,262 ms
171,252 KB |
testcase_11 | AC | 238 ms
63,576 KB |
testcase_12 | AC | 1,897 ms
201,088 KB |
testcase_13 | AC | 959 ms
127,276 KB |
testcase_14 | AC | 1,918 ms
210,900 KB |
testcase_15 | AC | 746 ms
115,028 KB |
testcase_16 | TLE | - |
testcase_17 | AC | 1,394 ms
171,472 KB |
testcase_18 | AC | 96 ms
51,392 KB |
testcase_19 | AC | 1,899 ms
213,020 KB |
testcase_20 | AC | 1,977 ms
197,276 KB |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | AC | 1,117 ms
126,156 KB |
testcase_24 | TLE | - |
testcase_25 | AC | 744 ms
115,172 KB |
testcase_26 | AC | 1,133 ms
131,916 KB |
testcase_27 | TLE | - |
testcase_28 | AC | 1,862 ms
200,660 KB |
testcase_29 | AC | 1,244 ms
170,724 KB |
testcase_30 | AC | 1,842 ms
201,140 KB |
testcase_31 | TLE | - |
testcase_32 | AC | 182 ms
57,392 KB |
testcase_33 | AC | 136 ms
54,888 KB |
testcase_34 | AC | 1,296 ms
170,732 KB |
testcase_35 | AC | 1,937 ms
221,164 KB |
testcase_36 | TLE | - |
testcase_37 | TLE | - |
testcase_38 | TLE | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
testcase_54 | -- | - |
testcase_55 | -- | - |
testcase_56 | -- | - |
testcase_57 | -- | - |
ソースコード
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(); HashMap<Integer, ArrayList<Integer>> connections = new HashMap<>(); int[] values = new int[n + 2]; for (int i = 0; i < n + 2; i++) { values[i] = sc.nextInt(); for (int j = 0; j < 30; j++) { values[i] ^= (1 << j); if (!connections.containsKey(values[i])) { connections.put(values[i], new ArrayList<>()); } connections.get(values[i]).add(i); values[i] ^= (1 << j); } } ArrayList<ArrayList<Integer>> graph = new ArrayList<>(); for (int x : values) { if (connections.containsKey(x)) { graph.add(connections.get(x)); } else { graph.add(new ArrayList<>()); } } PriorityQueue<Path> queue = new PriorityQueue<>(); queue.add(new Path(0, 0)); int[] costs = new int[n + 2]; 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 (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 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(); } }