Submission #66749180

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def SI(): return input()
def NI(): return int(input())
def TI(): return map(int, input().split())
def TI1(): return map(lambda x: int(x)-1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(lambda x: int(x)-1, input().split()))
def Yes(): print("Yes")
def No(): print("No")
def YN(flg): print("YNeos"[not flg::2])
#from sortedcontainers import SortedSet, SortedList, SortedDict
from collections import Counter, defaultdict, deque
#from bisect import bisect, bisect_left, bisect_right
#from itertools import permutations, combinations, product
#from math import sqrt, atan, pi, ceil
#from heapq import heappush, heappop
#from functools import lru_cache
MOD = 998244353
N, M = TI()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def SI(): return input()
def NI(): return int(input())
def TI(): return map(int, input().split())
def TI1(): return map(lambda x: int(x)-1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(lambda x: int(x)-1, input().split()))
def Yes(): print("Yes")
def No(): print("No")
def YN(flg): print("YNeos"[not flg::2])

#from sortedcontainers import SortedSet, SortedList, SortedDict
from collections import Counter, defaultdict, deque
#from bisect import bisect, bisect_left, bisect_right
#from itertools import permutations, combinations, product
#from math import sqrt, atan, pi, ceil
#from heapq import heappush, heappop
#from functools import lru_cache

MOD = 998244353

N, M = TI()
G = defaultdict(list)
for _ in range(M):
  A, B, W = TI()
  A -= 1
  B -= 1
  G[A].append((B, W))
  G[B].append((A, W))

d = [-1]*N
d[0] = 0
X = []
q = deque()
q.append(0)

while q:
  u = q.popleft()
  for v, w in G[u]:
    if d[v] == -1:
      d[v] = d[u] ^ w
      q.append(v)
    else:
      a = d[u] ^ d[v] ^ w
      for x in X:
        a = min(a, a ^ x)
      
      if a != 0:
        X.append(a)
        X.sort(reverse = True)

ans = d[-1]

for x in X:
  ans = min(ans, ans ^ x)

if ans < 0:
  print(-1)
else:
  print(ans)

Submission Info

Judge Result