Submission #63523218

---

Source Code Expand

import collections

def read():
    return int(input())

def reads():
    return [int(s) for s in input().split()]

def yn(x):
    print('Yes' if x else 'No')

def solve():
    n, m = reads()
    adj = {k: [] for k in range(n)}
    for j in range(m):
        u, v, w = reads()
        u, v = u - 1, v - 1
        adj[u].append((v, w))
        adj[v].append((u, w))

    def dfs(u, s, path):
        if u == n - 1:
            return path
        ret = 1 << 60
        for v, w in adj[u]:
            if v not in s:
                s.add(v)
                ret = min(ret, dfs(v, s, path ^ w))
                s.remove(v)
        return ret

    print(min(dfs(0, {0}, 0) for u in range(n)))



if __name__ == '__main__':
    solve()

Submission Info

Judge Result