提出 #66747245

---

ソースコード 拡げる

from sys import stdin
input = stdin.readline


def solve():
    node_size, edge_count = map(int, input().split())
    graph = [[] for _ in range(node_size + 1)]
    for _ in range(edge_count):
        one, two, cost = map(int, input().split())
        graph[one].append((two, cost))

    stack = [(1, 0)]
    seen = set(stack)
    result = float('inf')
    while stack:
        node, cost = stack.pop()
        if node == node_size:
            result = min(result, cost)

        for other, other_cost in graph[node]:
            new_cost = cost ^ other_cost
            if (other, new_cost) not in seen:
                seen.add((other, new_cost))
                stack.append((other, new_cost))


    if result == float('inf'):
        result = -1

    return result


print(solve())

提出情報

ジャッジ結果