1013 Battle Over Cities (25 point(s))
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
题目大意:
N 个城市,M 条道路,当删除一个城市和它的道路后,求使剩下的城市重新连通,至少需要添加几条道路
设计思路:
图的遍历
- 实际上本题是求,图中删除一个节点后,剩余图的连通分量是多少;
- 添加的最少路线,就是连通分量数 - 1;
编译器:C (gcc)
#include <stdio.h>
void dfs(int n, int node, int visit[], int graph[][1001])
{
int i;
visit[node] = 1;
for (i = 1; i <= n; i++) {
if (visit[i] == 0 && graph[node][i] == 1)
dfs(n, i, visit, graph);
}
}
int main(void)
{
int n, m, k;
int graph[1001][1001] = {{0}}, visit[1001], count;
int a, b, i, j;
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
graph[a][b] = graph[b][a] = 1;
}
for (i = 0; i < k; i++) {
for (j = 0; j < 1001; j++)
visit[j] = 0;
scanf("%d", &a);
count = 0;
visit[a] = 1;
for (j = 1; j <= n; j++) {
if (visit[j] == 0) {
dfs(n, j, visit, graph);
count++;
}
}
printf("%d\n", count - 1);
}
return 0;
}