Submission #66780262


Source Code Expand

Copy
from collections import defaultdict
n, m = map(int, input().split())
a = [0] * m
b = [0] * m
w = [0] * m
for i in range(m):
a[i], b[i], w[i] = map(int, input().split())
g = defaultdict(list)
for i in range(m):
g[a[i]].append((b[i], w[i]))
g[b[i]].append((a[i], w[i]))
d = [-1] * (n + 1)
d[1] = 0
s = [1]
c = []
while s:
u = s.pop()
for v, x in g[u]:
if d[v] == -1:
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
from collections import defaultdict

n, m = map(int, input().split())
a = [0] * m
b = [0] * m
w = [0] * m
for i in range(m):
    a[i], b[i], w[i] = map(int, input().split())
g = defaultdict(list)
for i in range(m):
    g[a[i]].append((b[i], w[i]))
    g[b[i]].append((a[i], w[i]))
d = [-1] * (n + 1)
d[1] = 0
s = [1]
c = []

while s:
    u = s.pop()
    for v, x in g[u]:
        if d[v] == -1:
            d[v] = d[u] ^ x
            s.append(v)
        else:
            y = d[u] ^ x ^ d[v]
            z = y
            for b in c:
                z = min(z, z ^ b)
            if z != 0:
                c.append(z)
                c.sort(reverse=True)
r = d[n]
for b in c:
    r = min(r, r ^ b)
print(r)

Submission Info

Submission Time
Task D - XOR Shortest Walk
User practicejoi
Language Python (PyPy 3.10-v7.3.12)
Score 0
Code Size 744 Byte
Status WA
Exec Time 84 ms
Memory 83628 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
WA × 1
AC × 25
WA × 8
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 64 ms 76972 KiB
hand_02.txt AC 64 ms 76740 KiB
hand_03.txt WA 65 ms 76856 KiB
hand_04.txt AC 64 ms 76624 KiB
hand_05.txt WA 65 ms 76864 KiB
hand_06.txt WA 65 ms 76948 KiB
hand_07.txt WA 64 ms 76776 KiB
hand_08.txt WA 64 ms 76804 KiB
random_01.txt AC 65 ms 77076 KiB
random_02.txt AC 73 ms 81188 KiB
random_03.txt AC 65 ms 77040 KiB
random_04.txt AC 69 ms 77028 KiB
random_05.txt AC 65 ms 76872 KiB
random_06.txt AC 67 ms 77128 KiB
random_07.txt AC 64 ms 76944 KiB
random_08.txt AC 72 ms 81440 KiB
random_09.txt AC 65 ms 77040 KiB
random_10.txt AC 76 ms 81752 KiB
random_11.txt AC 65 ms 76836 KiB
random_12.txt AC 73 ms 81112 KiB
random_13.txt AC 72 ms 81420 KiB
random_14.txt AC 73 ms 81732 KiB
random_15.txt AC 71 ms 81624 KiB
random_16.txt AC 66 ms 76748 KiB
random_17.txt AC 82 ms 83628 KiB
random_18.txt AC 81 ms 83592 KiB
random_19.txt WA 82 ms 83492 KiB
random_20.txt WA 83 ms 83400 KiB
random_21.txt AC 84 ms 83148 KiB
random_22.txt AC 83 ms 83440 KiB
sample_01.txt AC 66 ms 76700 KiB
sample_02.txt AC 67 ms 76944 KiB
sample_03.txt WA 66 ms 76968 KiB


2025-06-16 (Mon)
14:19:20 +09:00