Submission #63529674

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import sys
sys.setrecursionlimit(10**6)
n,m=map(int,input().split())
uv=[[] for i in range(n)]
s=[0 for i in range(n)]
ans=10**25
for i in range(m):
    u,v,w=map(int,input().split())
    u,v=u-1,v-1
    uv[u].append([v,w])
    uv[v].append([u,w])
def dfs(x):
    global y,z,ans
    s[x]=1
    if(x==n-1):
        y=z[0]
        for i in range(1,len(z)):
            y^=z[i]
        ans=min(ans,y)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import sys
sys.setrecursionlimit(10**6)
n,m=map(int,input().split())
uv=[[] for i in range(n)]
s=[0 for i in range(n)]
ans=10**25

for i in range(m):
    u,v,w=map(int,input().split())
    u,v=u-1,v-1
    uv[u].append([v,w])
    uv[v].append([u,w])

def dfs(x):
    global y,z,ans
    s[x]=1
    if(x==n-1):
        y=z[0]
        for i in range(1,len(z)):
            y^=z[i]
        ans=min(ans,y)
        s[x]=0
        return
    for i in range(len(uv[x])):
        if(s[uv[x][i][0]]==0):
            z.append(uv[x][i][1])
            dfs(uv[x][i][0])
            z.pop()
    s[x]=0

z=[]
y=0
dfs(0)

print(ans)

Submission Info

Judge Result