Submission #66769192
Source Code Expand
Copy
from collections import dequeN, M = map(int, input().split())adj = [[] for _ in range(N + 1)]for _ in range(M):a, b, w = map(int, input().split())adj[a].append((b, w))MAX_X = 1 << 10visited = [[False] * MAX_X for _ in range(N + 1)]q = deque()visited[1][0] = Trueq.append((1, 0))while q:v, x = q.popleft()for nxt, w in adj[v]:nx = x ^ wif not visited[nxt][nx]:
from collections import deque N, M = map(int, input().split()) adj = [[] for _ in range(N + 1)] for _ in range(M): a, b, w = map(int, input().split()) adj[a].append((b, w)) MAX_X = 1 << 10 visited = [[False] * MAX_X for _ in range(N + 1)] q = deque() visited[1][0] = True q.append((1, 0)) while q: v, x = q.popleft() for nxt, w in adj[v]: nx = x ^ w if not visited[nxt][nx]: visited[nxt][nx] = True q.append((nxt, nx)) for ans in range(MAX_X): if visited[N][ans]: print(ans) exit() print(-1)
Submission Info
Submission Time | |
---|---|
Task | D - XOR Shortest Walk |
User | kangping |
Language | Python (PyPy 3.10-v7.3.12) |
Score | 400 |
Code Size | 601 Byte |
Status | AC |
Exec Time | 153 ms |
Memory | 91540 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, hand_07.txt, hand_08.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
hand_01.txt | AC | 83 ms | 76972 KiB |
hand_02.txt | AC | 84 ms | 76788 KiB |
hand_03.txt | AC | 84 ms | 76940 KiB |
hand_04.txt | AC | 84 ms | 76840 KiB |
hand_05.txt | AC | 84 ms | 76880 KiB |
hand_06.txt | AC | 84 ms | 77128 KiB |
hand_07.txt | AC | 85 ms | 76868 KiB |
hand_08.txt | AC | 84 ms | 76988 KiB |
random_01.txt | AC | 84 ms | 76588 KiB |
random_02.txt | AC | 91 ms | 76800 KiB |
random_03.txt | AC | 84 ms | 76792 KiB |
random_04.txt | AC | 90 ms | 76808 KiB |
random_05.txt | AC | 85 ms | 76896 KiB |
random_06.txt | AC | 85 ms | 76844 KiB |
random_07.txt | AC | 83 ms | 76656 KiB |
random_08.txt | AC | 93 ms | 77200 KiB |
random_09.txt | AC | 86 ms | 76848 KiB |
random_10.txt | AC | 106 ms | 86184 KiB |
random_11.txt | AC | 86 ms | 76732 KiB |
random_12.txt | AC | 94 ms | 76836 KiB |
random_13.txt | AC | 105 ms | 81960 KiB |
random_14.txt | AC | 140 ms | 85320 KiB |
random_15.txt | AC | 96 ms | 81536 KiB |
random_16.txt | AC | 86 ms | 76752 KiB |
random_17.txt | AC | 105 ms | 85904 KiB |
random_18.txt | AC | 102 ms | 85812 KiB |
random_19.txt | AC | 135 ms | 91336 KiB |
random_20.txt | AC | 132 ms | 91184 KiB |
random_21.txt | AC | 148 ms | 91300 KiB |
random_22.txt | AC | 153 ms | 91540 KiB |
sample_01.txt | AC | 81 ms | 76868 KiB |
sample_02.txt | AC | 79 ms | 76932 KiB |
sample_03.txt | AC | 82 ms | 76952 KiB |