题目:
战争中保持各个城市间的连通性非常重要。本题要求你编写一个报警程序,当失去一个城市导致国家被分裂为多个无法连通的区域时,就发出红色警报。注意:若该国本来就不完全连通,是分裂的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.
代码:
#include<iostream>
using namespace std;
int n, m;
const int maxn = 500;
bool visited[maxn] = {false};
int graph[maxn][maxn]={ 0 };
void dfs(int city)
{
visited[city] = true;
for (int i = 0; i < n; i++)
{
if (!visited[i] && graph[city][i] == 1 && graph[i][city] == 1)
{
dfs(i);
}
}
}
int Count_roads()
{
int count1 = 0;
fill(visited, visited + maxn, false);
for (int i = 0; i < n; i++)
{
if (!visited[i])
{
dfs(i);
count1++;
}
}
return count1;
}
int main()
{
cin >> n >> m;
int city1, city2;
for (int i = 0; i < m; i++)
{
cin >> city1 >> city2;
graph[city1][city2] = 1;
graph[city2][city1] = 1;
}
//计算所有的联通路条数
int cnt1 = Count_roads();
//逐步减去
int k;
cin >> k;
for (int i = 0; i < k; i++)
{
int city;
cin >> city;
for (int j = 0; j < n; j++)
{
if (graph[j][city] == 1)
{
graph[city][j] = 0; graph[j][city] = 0;
}
}
int cnt2 = Count_roads();
if(cnt2-cnt1>1)
printf("Red Alert: City %d is lost!\n", city);
else
printf("City %d is lost.\n", city);
//更新连通数
cnt1 = cnt2;
}
if (k == n)
cout << "Game Over.";
}