結果
問題 | No.1576 織姫と彦星 |
ユーザー | mkawa2 |
提出日時 | 2022-10-06 14:41:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 416 ms / 2,000 ms |
コード長 | 1,225 bytes |
コンパイル時間 | 279 ms |
コンパイル使用メモリ | 86,628 KB |
実行使用メモリ | 77,608 KB |
最終ジャッジ日時 | 2023-08-31 01:03:00 |
合計ジャッジ時間 | 15,114 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
71,264 KB |
testcase_01 | AC | 91 ms
71,260 KB |
testcase_02 | AC | 92 ms
70,980 KB |
testcase_03 | AC | 92 ms
71,116 KB |
testcase_04 | AC | 93 ms
71,488 KB |
testcase_05 | AC | 92 ms
71,484 KB |
testcase_06 | AC | 94 ms
71,732 KB |
testcase_07 | AC | 174 ms
76,776 KB |
testcase_08 | AC | 149 ms
77,140 KB |
testcase_09 | AC | 100 ms
76,740 KB |
testcase_10 | AC | 307 ms
77,360 KB |
testcase_11 | AC | 102 ms
76,536 KB |
testcase_12 | AC | 226 ms
77,156 KB |
testcase_13 | AC | 352 ms
77,156 KB |
testcase_14 | AC | 270 ms
77,524 KB |
testcase_15 | AC | 267 ms
77,168 KB |
testcase_16 | AC | 319 ms
77,020 KB |
testcase_17 | AC | 263 ms
76,820 KB |
testcase_18 | AC | 126 ms
77,180 KB |
testcase_19 | AC | 149 ms
77,024 KB |
testcase_20 | AC | 262 ms
77,272 KB |
testcase_21 | AC | 253 ms
77,544 KB |
testcase_22 | AC | 293 ms
77,304 KB |
testcase_23 | AC | 117 ms
76,808 KB |
testcase_24 | AC | 124 ms
76,768 KB |
testcase_25 | AC | 320 ms
77,608 KB |
testcase_26 | AC | 162 ms
77,316 KB |
testcase_27 | AC | 104 ms
76,764 KB |
testcase_28 | AC | 300 ms
77,104 KB |
testcase_29 | AC | 160 ms
77,128 KB |
testcase_30 | AC | 92 ms
71,488 KB |
testcase_31 | AC | 168 ms
77,100 KB |
testcase_32 | AC | 250 ms
76,980 KB |
testcase_33 | AC | 398 ms
77,396 KB |
testcase_34 | AC | 103 ms
76,804 KB |
testcase_35 | AC | 189 ms
76,984 KB |
testcase_36 | AC | 113 ms
76,900 KB |
testcase_37 | AC | 416 ms
77,480 KB |
testcase_38 | AC | 296 ms
77,052 KB |
testcase_39 | AC | 211 ms
77,340 KB |
testcase_40 | AC | 178 ms
77,088 KB |
testcase_41 | AC | 192 ms
77,556 KB |
testcase_42 | AC | 104 ms
76,764 KB |
testcase_43 | AC | 129 ms
77,508 KB |
testcase_44 | AC | 383 ms
77,476 KB |
testcase_45 | AC | 174 ms
77,120 KB |
testcase_46 | AC | 279 ms
77,208 KB |
testcase_47 | AC | 132 ms
77,468 KB |
testcase_48 | AC | 198 ms
77,148 KB |
testcase_49 | AC | 190 ms
76,984 KB |
testcase_50 | AC | 102 ms
77,000 KB |
testcase_51 | AC | 117 ms
77,036 KB |
testcase_52 | AC | 391 ms
77,576 KB |
testcase_53 | AC | 254 ms
77,084 KB |
testcase_54 | AC | 316 ms
77,348 KB |
testcase_55 | AC | 382 ms
77,056 KB |
testcase_56 | AC | 416 ms
77,144 KB |
testcase_57 | AC | 100 ms
77,184 KB |
testcase_58 | AC | 155 ms
77,056 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)