Submission #66736576


Source Code Expand

Copy
from collections import deque
n,m=map(int,input().split())
g=[[] for _ in range(n+1)]
for _ in range(m):
a,b,w=map(int,input().split())
g[a].append((b,w))
d=[-1]*(n+1)
d[1]=0
q=deque()
q.append(1)
basis=[]
def insert(x):
for b in basis:
x=min(x,x^b)
if x:
basis.append(x)
while q:
v=q.popleft()
for u,w in g[v]:
x=d[v]^w
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
from collections import deque

n,m=map(int,input().split())
g=[[] for _ in range(n+1)]
for _ in range(m):
    a,b,w=map(int,input().split())
    g[a].append((b,w))
d=[-1]*(n+1)
d[1]=0
q=deque()
q.append(1)
basis=[]
def insert(x):
    for b in basis:
        x=min(x,x^b)
    if x:
        basis.append(x)
while q:
    v=q.popleft()
    for u,w in g[v]:
        x=d[v]^w
        if d[u]==-1:
            d[u]=x
            q.append(u)
        else:
            insert(d[u]^x)
if d[n]==-1:
    print(-1)
else:
    res=d[n]
    for b in basis:
        res=min(res,res^b)
    print(res)

Submission Info

Submission Time
Task D - XOR Shortest Walk
User Untitle
Language Python (PyPy 3.10-v7.3.12)
Score 0
Code Size 616 Byte
Status WA
Exec Time 79 ms
Memory 81612 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 30
WA × 3
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 67 ms 76940 KiB
hand_02.txt AC 67 ms 76796 KiB
hand_03.txt AC 68 ms 76728 KiB
hand_04.txt AC 67 ms 77044 KiB
hand_05.txt AC 67 ms 76788 KiB
hand_06.txt WA 67 ms 76772 KiB
hand_07.txt WA 67 ms 77076 KiB
hand_08.txt WA 67 ms 76716 KiB
random_01.txt AC 67 ms 77080 KiB
random_02.txt AC 73 ms 77060 KiB
random_03.txt AC 67 ms 76964 KiB
random_04.txt AC 72 ms 76704 KiB
random_05.txt AC 67 ms 76708 KiB
random_06.txt AC 70 ms 76816 KiB
random_07.txt AC 67 ms 76764 KiB
random_08.txt AC 72 ms 76824 KiB
random_09.txt AC 68 ms 76820 KiB
random_10.txt AC 76 ms 81052 KiB
random_11.txt AC 67 ms 76784 KiB
random_12.txt AC 73 ms 76792 KiB
random_13.txt AC 74 ms 81136 KiB
random_14.txt AC 74 ms 80844 KiB
random_15.txt AC 73 ms 80812 KiB
random_16.txt AC 68 ms 77080 KiB
random_17.txt AC 79 ms 80892 KiB
random_18.txt AC 78 ms 81248 KiB
random_19.txt AC 78 ms 80920 KiB
random_20.txt AC 79 ms 81612 KiB
random_21.txt AC 78 ms 80956 KiB
random_22.txt AC 78 ms 80824 KiB
sample_01.txt AC 68 ms 77028 KiB
sample_02.txt AC 68 ms 76916 KiB
sample_03.txt AC 68 ms 77132 KiB


2025-08-11 (Mon)
10:46:35 +09:00