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 city​1​​-city​2​​ and city​1​​-city​3​​. Then if city​1​​ is occupied by the enemy, we must have 1 highway repaired, that is the highway city​2​​-city​3​​.

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 Knumbers, 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

 题目大意：

由于在战争期间，一些城市被敌人攻占而无法开放，导致城市间无法连通，因此需要修复道路使其他城市间能够连通。给出城市编号、城市间的道路以及被侵占的城市编号，现要求你求出在某个城市被侵占的情况下，使各个城市间（除被侵占的城市外）能够相互连通需要修复的道路数量。

代码如下：

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
//思路：
//1.用并查集统计连通分量 
//2.要求出除被攻占的城市外其他城市是否连通，即求出除被攻占的点外其他点是否在一个连通分量中
//3.vector存储下题目给出的互通路径，后根据给出的被攻占的城市考虑是否连接这条路径（即是否要merge） 
//4.需要修复的高速公路数量 = 连通分量数量 - 2（包括被攻占的城市独立开所占用的连通分量） 


struct Road{
	int a;
	int b;
}; 

int N,M,K;
int father[1010];
vector<Road> roads;  

//寻找根 
int findFather(int x){
	if(father[x] == x)
		return x;
	else
		return father[x];
} 
//合并 
void merge(int x,int y){
	int fa = findFather(x);
	int fb = findFather(y);
	if(fa != fb)
		father[fb] = fa;
}

int main(){
	scanf("%d%d%d",&N,&M,&K);
	for(int i = 1 ; i <= M ; i ++){
		Road r;
		scanf("%d%d",&r.a,&r.b);
		roads.push_back(r);
	}
	for(int i = 1 ; i <= K ; i ++){
		int city;
		scanf("%d",&city);
		for(int z = 1 ; z <= N ; z ++)
			father[z] = z;	
		for(int j = 0 ; j < roads.size() ; j ++){
			if(roads[j].a != city && roads[j].b != city){
				merge(roads[j].a,roads[j].b);
			}
		}
		int sum = 0; //连通分量个数 
		for(int k = 1 ; k <= N ; k++){ 
			if(findFather(k) == k)
				sum ++;
		}
		printf("%d\n",sum-2);
	}
	return 0;
}