Submission #63532221

---

Source Code Expand

n,m=gets.split.map(&:to_i)
g=Array.new(n+1){[]}
m.times{x,y,z=gets.split.map(&:to_i);g[x]<<[y,z];g[y]<<[x,z]}
d=Array.new(n+1)
r=Array.new(n+1,0)
(1..n).each{|i|
  next if d[i]
  q=[i];d[i]=0;comp=[]
  while !q.empty?
    u=q.shift;comp<<u
    g[u].each{|v,w|
      if d[v].nil? then d[v]=d[u]^w;q<<v
      elsif d[v]!=(d[u]^w) then puts -1;exit
      end
    }
  end
  t=0;k=comp.size
  32.times{|b| c=comp.count{|v| d[v]>>b&1==1}; t|=1<<b if k-c<c}
  comp.each{|v| r[v]=d[v]^t}
}
puts r[1..-1].join(" ")

Submission Info

Judge Result