It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other highways to keep the rest of the cities connected. Given the map of cities which have all the remaining highways marked, you are supposed to tell the number of highways need to be repaired, quickly.
For example, if we have 3 cities and 2 highways connecting city1-city2 and city1-city3. Then if city1 is occupied by the enemy, we must have 1 highway repaired, that is the highway city2-city3.
Input Specification:
Each input file contains one test case. Each case starts with a line containing 3 numbers N (<1000), M and K, which are the total number of cities, the number of remaining highways, and the number of cities to be checked, respectively. Then M lines follow, each describes a highway by 2 integers, which are the numbers of the cities the highway connects. The cities are numbered from 1 to N. Finally there is a line containing K numbers, which represent the cities we concern.
Output Specification:
For each of the K cities, output in a line the number of highways need to be repaired if that city is lost.
Sample Input:
3 2 3
1 2
1 3
1 2 3
Sample Output:
1
0
0
思路:祝她爱情事业两开花,然后我失眠了,刷PAT写博客,特此纪念。
先将需要删去的城市设置成已访问,再计算连通分量即可。最后需要添加的边是连通分量的数量减1.
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1010;
int in[maxn][maxn]; //图
bool vis[maxn] = {false};
int n; // 城市总数
int m; // 现存路径数量
int k; // 需要考虑被攻占的城市的数量
void DFS(int i)
{ // 深度优先访问一个连通块
vis[i] = true;
for(int j = 1; j <= n; j++)
{
if(vis[j] == false && in[i][j] == 1) // j未被访问过并且
DFS(j);
}
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
memset(in, 0, sizeof(in)); //设置所有点不可达
for(int i = 0; i < m; i++) //输入边
{
int st, ed; // start and end
scanf("%d%d", &st, &ed);
in[st][ed] = 1;
in[ed][st] = 1;
}
for(int i = 0; i < k; i++)
{
int city;
scanf("%d", &city);
vis[city] = true; // 将被删去的结点设置成已访问
int num = 0; //连通分量的数量
for(int i = 1; i <= n; i++)
{
if(vis[i] == false)
{
num++;
DFS(i);
}
}
printf("%d\n", num - 1);
memset(vis, false, sizeof(vis));
}
return 0;
}