PAT Advanced Level 1013 Battle Over Cities (25)（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

Each input file contains one test case. Each case starts with a line containing 3 numbers N (&lt1000), 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

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

只会算法不会读题一点用都没有，小BUG浪费了我二十分钟，我是以考试的心情做的，结果并不理想，我已经预见了
九月八号我的未来，但是这并不妨碍我继续做梦??。

/**********************
author: yomi
date: 18.8.19
ps:
**********************/
#include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1010;
vector<int>g[maxn];
int no[maxn], n;
bool vis[maxn];

void dfs(int index)
{
    if(index == n+1)
        return;
    if(!vis[index]){
        vis[index] = true;
        for(int i=0; i<g[index].size(); i++){
            dfs(g[index][i]);
        }
    }
}
int main()
{
    int m, k, u, v, d, cnt = 0;
    scanf("%d%d%d", &n, &m, &k);
    for(int i=1; i<=m; i++){
        scanf("%d%d", &u, &v);
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i=1; i<=k; i++){
        cnt = 0;
        memset(vis, 0, sizeof(vis));
        scanf("%d", &d);
        vis[d] = true;
        for(int j=1; j<=n; j++){///BUG所在之处，原来写成了k,k只是我们关心的城市数啊。当然要遍历所有城市了。
            if(vis[j]){
                continue;
            }
            dfs(j);
            cnt++;
        }
        cout << cnt-1 << endl;
    }

    return 0;
}
/**
Sample Input
3 2 3
1 2
1 3
1 2 3
Sample Output
1
0
0
**/