Submission #63520977

---

Source Code Expand

n, m = map(int, input().split())
adj = {u: {} for u in range(n+1)}

for _ in range(m):
    u, v, w = map(int, input().split())
    adj[u][v] = adj[v][u] = w

from sys import setrecursionlimit
setrecursionlimit(10**6)

visited = [False for _ in range(n+1)]
def backtrack(u, curr):
    if u == n:
        return curr

    visited[u] = True

    best = 2**60 + 69
    for v, w in adj[u].items():
        if not visited[v]:
            best = min(best, backtrack(v, curr ^ w))
    
    visited[u] = False
    return best

print(backtrack(1, 0))

Submission Info

Judge Result