Submission #66772861


Source Code Expand

Copy
import sys
input = sys.stdin.readline
def main():
n, m = map(int, input().split())
g = [[] for _ in range(n)]
for _ in range(m):
u, v, w = map(int, input().split())
g[u-1].append((v-1, w))
dist = [None]*n
dist[0] = 0
basis = []
stack = [0]
while stack:
u = stack.pop()
for v, w in g[u]:
x = dist[u] ^ w
if dist[v] is None:
dist[v] = x
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
import sys
input = sys.stdin.readline

def main():
    n, m = map(int, input().split())
    g = [[] for _ in range(n)]
    for _ in range(m):
        u, v, w = map(int, input().split())
        g[u-1].append((v-1, w))

    dist = [None]*n
    dist[0] = 0
    basis = []
    stack = [0]

    while stack:
        u = stack.pop()
        for v, w in g[u]:
            x = dist[u] ^ w
            if dist[v] is None:
                dist[v] = x
                stack.append(v)
            else:
                y = x ^ dist[v]
                for b in sorted(basis, reverse=True):
                    y = min(y, y ^ b)
                if y:
                    basis.append(y)

    if dist[-1] is None:
        print(-1)
        return

    res = dist[-1]
    for b in sorted(basis, reverse=True):
        res = min(res, res ^ b)
    print(res)

if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task D - XOR Shortest Walk
User MoonStep
Language Python (CPython 3.11.4)
Score 0
Code Size 919 Byte
Status WA
Exec Time 12 ms
Memory 9224 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 10 ms 8888 KiB
hand_02.txt AC 10 ms 8788 KiB
hand_03.txt AC 10 ms 8932 KiB
hand_04.txt AC 10 ms 8764 KiB
hand_05.txt AC 10 ms 8856 KiB
hand_06.txt WA 10 ms 8580 KiB
hand_07.txt WA 10 ms 8920 KiB
hand_08.txt WA 10 ms 8544 KiB
random_01.txt AC 10 ms 8868 KiB
random_02.txt AC 11 ms 9036 KiB
random_03.txt AC 10 ms 8896 KiB
random_04.txt AC 11 ms 9072 KiB
random_05.txt AC 10 ms 8836 KiB
random_06.txt AC 10 ms 8908 KiB
random_07.txt AC 10 ms 8896 KiB
random_08.txt AC 11 ms 9024 KiB
random_09.txt AC 10 ms 8844 KiB
random_10.txt AC 11 ms 9096 KiB
random_11.txt AC 11 ms 8816 KiB
random_12.txt AC 11 ms 9128 KiB
random_13.txt AC 11 ms 9052 KiB
random_14.txt AC 11 ms 9016 KiB
random_15.txt AC 11 ms 9020 KiB
random_16.txt AC 10 ms 8980 KiB
random_17.txt AC 11 ms 9144 KiB
random_18.txt AC 12 ms 9200 KiB
random_19.txt AC 11 ms 9224 KiB
random_20.txt AC 12 ms 8792 KiB
random_21.txt AC 12 ms 9160 KiB
random_22.txt AC 12 ms 9176 KiB
sample_01.txt AC 10 ms 8536 KiB
sample_02.txt AC 10 ms 8848 KiB
sample_03.txt AC 10 ms 8860 KiB


2025-06-16 (Mon)
14:46:25 +09:00