PAT 甲级 1013. Battle Over Cities (25) C++版

Posted on Edited on In

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

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

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

这个题目的本质是求有几个连通图，每两个连通图添加一条边就可以使图连通了 求连通图可以使用dfs，从某个结点进入，遍历完一圈（可能无法遍历整个图）就是一个连通子图

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

vector<vector<int> > cities;
int *visited;

void dfs(int cur, int ban) {
    for (int i = 0; i < cities[cur].size(); i++) {
        int c = cities[cur][i];
        if (!visited[c] && c != ban) {
            visited[c] = 1;
            dfs(c, ban);
        }
    }
}

int main() {
    int n = 0, m = 0, k = 0;
    scanf("%d %d %d", &n, &m, &k);
    cities.resize(n + 1);
    visited = new int[n + 1];
    for (int i = 0; i < m; i++) {
        int a = 0, b = 0;
        scanf("%d %d", &a, &b);
        cities[a].push_back(b);
        cities[b].push_back(a);
    }

    for (int i = 0; i < k; i++) {
        int t = 0, cnt = -1;
        scanf("%d", &t);

        fill(visited, visited + n + 1, 0);
        for (int j = 1; j <= n; j++) {
            if (!visited[j] && j != t) {
                cnt++;
                visited[j] = 1;
                dfs(j, t);
            }
        }
        printf("%d\n", cnt);
    }

    return 0;
}