Submission #66780568

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
n,m-map(int, input().split())
edges=[]
for i in range(m):
  a,b,w=map(int, input().split())
def solve(n, edges):
    from collections import defaultdict, deque
    graph = defaultdict(list)
    for u, v, w in edges:
        graph[u].append((v, w))
        graph[v].append((u, w))  
    dist = [-1] * (n + 1)
    dist[1] = 0
    basis = []
    def insert_basis(x):
        for b in basis:
            x = min(x, x ^ b)
        if x:
            basis.append(x)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

n,m-map(int, input().split())
edges=[]
for i in range(m):
  a,b,w=map(int, input().split())
def solve(n, edges):
    from collections import defaultdict, deque

    graph = defaultdict(list)
    for u, v, w in edges:
        graph[u].append((v, w))
        graph[v].append((u, w))  

    dist = [-1] * (n + 1)
    dist[1] = 0
    basis = []

    def insert_basis(x):
        for b in basis:
            x = min(x, x ^ b)
        if x:
            basis.append(x)
            basis.sort(reverse=True)

    dq = deque([1])
    while dq:
        u = dq.popleft()
        for v, w in graph[u]:
            xor_val = dist[u] ^ w
            if dist[v] == -1:
                dist[v] = xor_val
                dq.append(v)
            else:
                cycle = xor_val ^ dist[v]
                insert_basis(cycle)


    res = dist[n]
    for b in basis:
        res = min(res, res ^ b)

    return res


print(solve(n, edges))

Submission Info

Judge Result