战争中保持各个城市间的连通性非常重要。本题要求你编写一个报警程序,当失去一个城市导致国家被分裂为多个无法连通的区域时,就发出红色警报。注意:若该国本来就不完全连通,是分裂的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 <stdio.h>
#include <string.h>
const int maxn = 510;
int fa[maxn];
int vis[maxn];
int n,m;
int last;
struct City
{
int x,y;
}city[5100];
void init()
{
for (int i = 0; i < n; ++i)
{
fa[i] = i;
}
}
int findFa(int x)
{
if(x == fa[x])
return fa[x];
else
return fa[x] = findFa(fa[x]);
}
void Merge(int x,int y)
{
int fx = findFa(x),fy = findFa(y);
if(fx == fy)
return ;
fa[fy] = fx;
}
int count()
{
int sum = 0;
init();
for (int i = 0; i < m; ++i)
{
if(vis[city[i].x] && vis[city[i].y])
Merge(city[i].x,city[i].y);
}
for (int i = 0; i < n; ++i)
{
if(fa[i] == i && vis[i])
sum++;
}
return sum;
}
//是否连通
bool judge(int x)
{
vis[x] = 0;
int cur = count();
bool flag = (cur <= last);
last = cur;
return flag;
}
int main()
{
scanf("%d%d",&n,&m);
memset(vis,1,sizeof(vis));
for (int i = 0; i < m; ++i)
{
int x,y;
scanf("%d %d",&x,&y);
city[i].x = x;
city[i].y = y;
}
last = count();
int k,x;
scanf("%d",&k);
for (int i = 0; i < k; ++i)
{
scanf("%d",&x);
if(judge(x))
printf("City %d is lost.\n",x);
else
printf("Red Alert: City %d is lost!\n",x);
}
if(k >= n)
printf("Game Over.\n");
}