Submission #6498791

---

Source Code Expand

# require 'set'
N,M = gets.chomp.split(" ").map(&:to_i)
mat = []
M.times do
    mat << gets.chomp.split(" ").map(&:to_i)
end
S,T = gets.chomp.split(" ").map(&:to_i)

@graph = Array.new(N+1){[]}

# p [N,M]
# p mat
# p [S,T]

mat.each do |arr|
    u = arr[0]
    v = arr[1]
    @graph[u] << v
end
# p @graph
# (1..N).each do |n|

# next1 = []
=begin
@graph_2 = Array.new(N+1){Set.new}
(1..N).each do |n|
    @graph[n].each do |s1|
        @graph[s1].each do |s2|
            @graph[s2].each do |s3|
                if n != s3
                    @graph_2[n] << s3
                end
            end
        end
    end
end
=end
# p @graph_2
# next1.each do |n|
#     p n
# end
@visited = Array.new(N+1).map{Array.new(3)}
@q = []
@dist = Array.new(N+1).map{Array.new(3)}

def bfs(v)
    @visited[v][0] = true
    @dist[S][0]=0
    @q.push [v,0]

    while(node = @q.shift) do
        tmp,s = node
        # break if tmp == T and @visited[n][dist_tmp % 3]
        # p [tmp,s]
        break if tmp == T and s == 0

        nodes = @graph[tmp]
        nodes.each do |n|
            dist_tmp = @dist[tmp][s]
            # p [tmp,dist_tmp]
            if not @visited[n][(s+1) % 3]
                @visited[n][(s+1) % 3] = true
                @q.push [n, (s+1) % 3]
                @dist[n][(s+1) % 3] = dist_tmp + 1
            end
        end
    end
end

bfs(S)
# p @dist
# p @dist
# p @visited
puts @dist[T][0] ? @dist[T][0] / 3 : -1

Submission Info

Judge Result