战争中保持各个城市间的连通性非常重要。本题要求你编写一个报警程序,当失去一个城市导致国家被分裂为多个无法连通的区域时,就发出红色警报。注意:若该国本来就不完全连通,是分裂的k个区域,而失去一个城市并不改变其他城市之间的连通性,则不要发出警报。
输入格式:
输入在第一行给出两个整数N
(0 < N
≤ 500)和M
(≤ 5000),分别为城市个数(于是默认城市从0到N
-1编号)和连接两城市的通路条数。随后M
行,每行给出一条通路所连接的两个城市的编号,其间以1个空格分隔。在城市信息之后给出被攻占的信息,即一个正整数K
和随后的K
个被攻占的城市的编号。
注意:输入保证给出的被攻占的城市编号都是合法的且无重复,但并不保证给出的通路没有重复。
输出格式:
对每个被攻占的城市,如果它会改变整个国家的连通性,则输出Red Alert: City k is lost!
,其中k
是该城市的编号;否则只输出City k is lost.
即可。如果该国失去了最后一个城市,则增加一行输出Game Over.
。
输入样例:
5 4
0 1
1 3
3 0
0 4
5
1 2 0 4 3
输出样例:
City 1 is lost.
City 2 is lost.
Red Alert: City 0 is lost!
City 4 is lost.
City 3 is lost.
Game Over.
提交结果:
代码(测试点2,测试点4运行超时):
import sys
def dfs(node):
visit[node] = True
for i in range(n):
if visit[i] == False and e[node][i] == 1:
dfs(i)
def dfstrave():
cnt = 0
for i in range(n):
visit[i] = False
for i in range(n):
if visit[i] == False:
dfs(i)
cnt += 1
return cnt
n, m = list(map(int, sys.stdin.readline().split()))
visit = {}
e = [[0 for _ in range(n)] for _ in range(n)]
for i in range(m):
a, b = list(map(int, sys.stdin.readline().split()))
e[a][b] = 1
e[b][a] = 1
count = 0
cnt = dfstrave()
num = int(input())
city = list(map(int, sys.stdin.readline().split()))
for i in city:
for j in range(n):
if e[i][j] == 1:
e[i][j] = 0
e[j][i] = 0
tempcnt = dfstrave()
if tempcnt > cnt + 1:
print("Red Alert: City {} is lost!".format(i))
else:
print("City {} is lost.".format(i))
cnt = tempcnt
count += 1
if count == n:
print("Game Over.")