Submission #63556253

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)
N, M = map(int, input().split())
grid = defaultdict(list)
visit = [0 for i in range(11)]
for i in range(M):
  u, v, w = map(int, input().split())
  grid[u].append((v, w))
  grid[v].append((u, w))
ans = 10**60
def dfs(p, x):
  if p == N:
    global ans
    ans = min(ans, x)
    return
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from collections import defaultdict
import sys
sys.setrecursionlimit(10**8)

N, M = map(int, input().split())
grid = defaultdict(list)

visit = [0 for i in range(11)]

for i in range(M):
  u, v, w = map(int, input().split())
  grid[u].append((v, w))
  grid[v].append((u, w))

ans = 10**60

def dfs(p, x):
  if p == N:
    global ans
    ans = min(ans, x)
    return
  for j, w in grid[p]:
    if visit[j]:
      continue
    visit[j] = 1
    dfs(j, x^w)
    visit[j] = 0

visit[1] = 1
dfs(1, 0)
      
print(ans)

Submission Info

Judge Result