1013 Battle Over Cities (25 分)
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
题目大意:
给定一张城市图,当图中其中的一个城市被占领,则与其有关的道路都将无法通行。试问,给定的被占领的城市,询问在占领后需要建立多少条路才能使其余城市连同。
思路:
采用图的数据结构,用int G[1001][1001]保存,需要bool vis[1001]防止走回头路。当遇到被占领的城市的时候,直接跳过其相关的访问。用dfs或bfs都可以。遍历时,只要找出连同块的数量,而要修建的道路则是连通块数量 – 1。
参考代码:
#include<cstdio>
#include<algorithm>
using namespace std;
int g[1001][1001], n, m, k, lost;
bool vis[1001];
void dfs(int lost, int v){
vis[v] = true;
for(int i = 1; i <= n; ++i){
if(i == lost) continue;
if(g[v][i] && !vis[i]) dfs(lost, i);
}
return;
}
int main(){
scanf("%d %d %d", &n, &m, &k);
for(int i = 0; i < m; ++i){
int a, b;
scanf("%d %d", &a, &b);
g[a][b] = g[b][a] = 1;
}
for(int i = 0; i < k; ++i){
int cnt = 0;
scanf("%d", &lost);
fill(vis, vis + n + 1, false);
for(int j = 1; j <= n; ++j)
if(!vis[j] && j != lost) dfs(lost, j), cnt++;
printf("%d\n", cnt - 1);
}
return 0;
}