L2-013 红色警报 (25 分)
战争中保持各个城市间的连通性非常重要。本题要求你编写一个报警程序,当失去一个城市导致国家被分裂为多个无法连通的区域时,就发出红色警报。注意:若该国本来就不完全连通,是分裂的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 <bits/stdc++.h>
using namespace std;
const int N = 5000 + 10;
int n, m, k;
int u[N], v[N], vis[N], fa[N];
int Find(int x){return x == fa[x] ? x : fa[x] = Find(fa[x]);}
void uni(int a, int b){
int p = Find(a), q = Find(b);
if (p != q) fa[q] = p;
}
int work(){
int cnt = 0;
for (int i = 0; i < n; i++)
if (fa[i] == i)
cnt++;
return cnt;
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) fa[i] = i;
for (int i = 0; i < m; i++) {
scanf("%d%d", &u[i], &v[i]);
uni(u[i], v[i]);
}
scanf("%d", &k);
for (int t = 1; t <= k; t++) {
int x;
scanf("%d", &x);
int cnt1 = work();
vis[x] = 1;
for (int i = 0; i < n; i++) fa[i] = i;
for (int i = 0; i < m; i++)
if (!vis[u[i]] && !vis[v[i]])
uni(u[i], v[i]);
int cnt2 = work();
//cout<<"*"<<cnt1<<" "<<cnt2<<endl;
if (cnt2 > cnt1 + 1) printf("Red Alert: City %d is lost!\n", x);
else if (cnt2 == cnt1 + 1 || cnt2 == cnt1) printf("City %d is lost.\n", x);
}
if (k == n) printf("Game Over.\n");
return 0;
}
dfs
#include <bits/stdc++.h>
using namespace std;
const int N = 500 + 10;
int n, m, k;
int g[N][N], vis[N];
void dfs(int u){
vis[u] = 1;
for (int i = 0; i < n; i++)
if (g[u][i] && !vis[i])
dfs(i);
}
int work(){
int cnt = 0;
memset(vis, 0, sizeof vis);
for (int i = 0; i < n; i++)
if (!vis[i]) {
dfs(i);
cnt++;
}
return cnt;
}
int main()
{
scanf("%d%d", &n, &m);
while (m--) {
int x, y;
scanf("%d%d", &x, &y);
g[x][y] = g[y][x] = 1;
}
scanf("%d", &k);
for (int t = 1; t <= k; t++) {
int x;
scanf("%d", &x);
int cnt1 = work();
for (int i = 0; i < n; i++)
g[i][x] = g[x][i] = 0;
int cnt2 = work();
//cout<<"*"<<cnt1<<" "<<cnt2<<endl;
if (cnt2 > cnt1 + 1) printf("Red Alert: City %d is lost!\n", x);
else if (cnt2 == cnt1 + 1 || cnt2 == cnt1) printf("City %d is lost.\n", x);
}
if (k == n) printf("Game Over.\n");
return 0;
}