-
Notifications
You must be signed in to change notification settings - Fork 0
/
1013.cpp
79 lines (68 loc) · 1.48 KB
/
1013.cpp
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <iostream>
#include <vector>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef unsigned int uint;
int findCha(int i, const vector<int> &v) {
if(i == v[i])
return i;
else
return findCha(v[i], v);
}
void makeCha(vector<int> &v, vector<int> &rank) {
for(uint i = 0; i < v.size(); ++i)
v[i] = i;
for(uint i = 0; i < rank.size(); ++i)
rank[i] = 0;
}
void unionCha(int i, int j, vector<int> &v, vector<int> &rank) {
i = findCha(i, v);
j = findCha(j, v);
if(i == j)
return;
if(rank[i] > rank[j]) {
v[j] = i;
}
else {
v[i] = j;
if(rank[i] == rank[j]) {
++rank[j];
}
}
}
int main(int argc, char *argv[]) {
int N, M, K;
scanf("%d%d%d", &N, &M, &K);
vector< pair<int, int> > path(M, pair<int, int>(0, 0));
for(uint i = 0; i < path.size(); ++i) {
scanf("%d%d", &(path[i].first), &(path[i].second));
}
vector<int> check(K, 0);
for(uint i = 0; i < check.size(); ++i) {
scanf("%d", &check[i]);
}
vector<int> rank(N+1, 0);
vector<int> pre(N+1, 0);
int target;
for(uint i = 0; i < check.size(); ++i) {
target = check[i];
makeCha(pre, rank);
for(uint j = 0; j < path.size(); ++j) {
if(target == path[j].first || target == path[j].second)
continue;
unionCha(path[j].first, path[j].second, pre, rank);
}
vector<int> tmp(N+1, 0);
for(uint j = 1; j <= N; ++j) {
++tmp[findCha(j, pre)];
}
int count = 0;
for(uint j = 1; j <= N; ++j) {
if(0 != tmp[j])
++count;
}
printf("%d\n", count-2);
}
return 0;
}