Submission #66772974

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 = gets.split.map(&:to_i)
goto = Array.new(n + 1) { [] }
m.times do
  a, b, w = gets.split.map(&:to_i)
  goto[a] << [b, w]
end
dist = Array.new(n + 1)
dist[1] = 0
queue = [[1, 0]]
basis = []
until queue.empty?
  u, cost = queue.shift
  goto[u].each do |v, w|
    new_cost = cost ^ w
    if dist[v].nil?
      dist[v] = new_cost
      queue << [v, new_cost]
    else
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

n, m = gets.split.map(&:to_i)
goto = Array.new(n + 1) { [] }

m.times do
  a, b, w = gets.split.map(&:to_i)
  goto[a] << [b, w]
end

dist = Array.new(n + 1)
dist[1] = 0
queue = [[1, 0]]
basis = []

until queue.empty?
  u, cost = queue.shift
  goto[u].each do |v, w|
    new_cost = cost ^ w
    if dist[v].nil?
      dist[v] = new_cost
      queue << [v, new_cost]
    else
      cycle = dist[v] ^ new_cost
      basis << cycle if cycle != 0
    end
  end
end
def reduce(x, basis)
  basis.sort_by { |b| -b.bit_length }.each do |b|
    x = [x, x ^ b].min
  end
  x
end

if dist[n].nil?
  puts -1
else
  puts reduce(dist[n], basis)
end

Submission Info

Judge Result