結果
問題 | No.1576 織姫と彦星 |
ユーザー | mkawa2 |
提出日時 | 2022-10-06 14:41:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 328 ms / 2,000 ms |
コード長 | 1,225 bytes |
コンパイル時間 | 233 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 76,800 KB |
最終ジャッジ日時 | 2024-06-11 00:07:51 |
合計ジャッジ時間 | 10,831 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
53,888 KB |
testcase_01 | AC | 44 ms
53,888 KB |
testcase_02 | AC | 46 ms
54,016 KB |
testcase_03 | AC | 47 ms
53,760 KB |
testcase_04 | AC | 44 ms
53,888 KB |
testcase_05 | AC | 46 ms
53,760 KB |
testcase_06 | AC | 47 ms
54,784 KB |
testcase_07 | AC | 127 ms
76,416 KB |
testcase_08 | AC | 111 ms
76,288 KB |
testcase_09 | AC | 55 ms
62,848 KB |
testcase_10 | AC | 239 ms
76,160 KB |
testcase_11 | AC | 52 ms
63,360 KB |
testcase_12 | AC | 166 ms
76,416 KB |
testcase_13 | AC | 272 ms
76,160 KB |
testcase_14 | AC | 196 ms
76,544 KB |
testcase_15 | AC | 192 ms
76,416 KB |
testcase_16 | AC | 236 ms
76,288 KB |
testcase_17 | AC | 193 ms
76,544 KB |
testcase_18 | AC | 81 ms
76,288 KB |
testcase_19 | AC | 107 ms
76,416 KB |
testcase_20 | AC | 207 ms
76,416 KB |
testcase_21 | AC | 184 ms
76,160 KB |
testcase_22 | AC | 240 ms
76,160 KB |
testcase_23 | AC | 84 ms
76,032 KB |
testcase_24 | AC | 75 ms
76,160 KB |
testcase_25 | AC | 250 ms
76,416 KB |
testcase_26 | AC | 122 ms
76,032 KB |
testcase_27 | AC | 59 ms
64,768 KB |
testcase_28 | AC | 248 ms
76,544 KB |
testcase_29 | AC | 118 ms
76,160 KB |
testcase_30 | AC | 42 ms
54,912 KB |
testcase_31 | AC | 119 ms
76,416 KB |
testcase_32 | AC | 189 ms
76,160 KB |
testcase_33 | AC | 306 ms
76,544 KB |
testcase_34 | AC | 50 ms
63,744 KB |
testcase_35 | AC | 129 ms
76,160 KB |
testcase_36 | AC | 65 ms
74,112 KB |
testcase_37 | AC | 324 ms
76,672 KB |
testcase_38 | AC | 222 ms
76,416 KB |
testcase_39 | AC | 147 ms
76,416 KB |
testcase_40 | AC | 122 ms
76,160 KB |
testcase_41 | AC | 139 ms
76,416 KB |
testcase_42 | AC | 56 ms
65,792 KB |
testcase_43 | AC | 80 ms
76,160 KB |
testcase_44 | AC | 299 ms
76,416 KB |
testcase_45 | AC | 117 ms
76,160 KB |
testcase_46 | AC | 208 ms
76,416 KB |
testcase_47 | AC | 87 ms
76,288 KB |
testcase_48 | AC | 149 ms
76,160 KB |
testcase_49 | AC | 139 ms
76,288 KB |
testcase_50 | AC | 52 ms
64,256 KB |
testcase_51 | AC | 78 ms
75,904 KB |
testcase_52 | AC | 303 ms
76,416 KB |
testcase_53 | AC | 201 ms
76,288 KB |
testcase_54 | AC | 259 ms
76,288 KB |
testcase_55 | AC | 293 ms
76,544 KB |
testcase_56 | AC | 328 ms
76,800 KB |
testcase_57 | AC | 50 ms
62,592 KB |
testcase_58 | AC | 106 ms
76,416 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 from collections import deque def popcnt(a): return bin(a).count("1") n = II()+2 ss = LI()+LI() to = [[] for _ in range(n)] for i in range(n): for j in range(i): if popcnt(ss[i] ^ ss[j]) == 1: to[i].append(j) to[j].append(i) q = deque() dist = [inf]*n q.append(0) dist[0] = 0 while q: u = q.popleft() for v in to[u]: if dist[v] == inf: dist[v] = dist[u]+1 q.append(v) ans = dist[1]-1 if ans == inf-1: ans = -1 print(ans)