PAT-甲级-1013 Battle Over Cities (25 分)

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 Mlines 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个城市的高速连通关系，查询k个城市，当该城市被攻占时，应该修复几条高速才能让其他n-1个城市连通；即计算图的连通分量数，当从查询结点可以遍历整张图时，连通分量为1，需要修复的高速数为0。

解题思路：

• 用二维vector保存图的关系；
•  k次查询中，先将查询结点置为true，表示将该节点分割。
• for循环判断n个结点是否被访问，未被访问的dfs递归访问。

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,j,k)    for(int i=j;i<k;i++)
const int maxn=1010;

vector<int> v[maxn];
bool vis[maxn];
void dfs(int u){
    vis[u] = true;
    rep(i,0,v[u].size())
        if(vis[v[u][i]]==false)
            dfs(v[u][i]);
}
int main(){
    int n,m,k,a,b;
    scanf("%d %d %d",&n,&m,&k);
    rep(i,0,m){
        scanf("%d %d",&a,&b);
        v[a].push_back(b);
        v[b].push_back(a);
    }
    rep(i,0,k){
        int cnt = 0;
        fill(vis,vis+maxn,false);
        scanf("%d",&a);
        vis[a] = true;
        rep(j,1,n+1){
            if(vis[j]==false){
                dfs(j);
                cnt++;
            }
        }
        printf("%d\n",cnt-1);
    }
    return 0;
}