Created
October 4, 2017 12:00
-
-
Save whatalnk/c88752512abff6f9004a1baa65b858f1 to your computer and use it in GitHub Desktop.
AtCoder ABC #021 C - 正直者の高橋くん
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
MAX_C = 2 << 31 | |
R = 1000000007 | |
N = gets.chomp.to_i | |
g = Array.new(N+1){Array.new(N+1, MAX_C)} | |
(N+1).times do |i| | |
g[i][i] = 0 | |
end | |
a, b = gets.chomp.split(" ").map(&:to_i) | |
M = gets.chomp.to_i | |
M.times do | |
x, y = gets.chomp.split(" ").map(&:to_i) | |
g[x][y] = 1 | |
g[y][x] = 1 | |
end | |
# Warshall floyd | |
1.upto(N) do |k| | |
1.upto(N) do |i| | |
1.upto(N) do |j| | |
g[i][j] = g[i][k] + g[k][j] if g[i][k] + g[k][j] < g[i][j] | |
end | |
end | |
end | |
root = Array.new(N+1, 0) | |
root[a] = 1 | |
0.upto(N) do |d| | |
0.upto(N) do |cur| | |
next if g[a][cur] != d | |
1.upto(N) do |nex| | |
if g[a][nex] == d + 1 && g[cur][nex] == 1 | |
root[nex] += root[cur] | |
root[nex] %= R | |
end | |
end | |
end | |
end | |
puts root[b] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment