1013 Battle Over Cities (25分)
分析
依次将每个点标为已访问状态,计算连通分量个数
代码
#include<iostream>
#include<vector>
using namespace std;
vector<vector<int> >g;
int n, m, k, a, b, marked[1010];
int main() {
scanf("%d %d %d", &n, &m, &k);
g.resize(n + 1);
while (--m >= 0) {
scanf("%d %d", &a, &b);
g[a].push_back(b);
g[b].push_back(a);
}
while (--k >= 0) {
scanf("%d", &a);
fill(marked, marked + 1010, 0);
marked[a] = 1;
vector<int> v;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (marked[i])continue;
v.push_back(i);
while (!v.empty()) {
int d = v.back();
v.pop_back();
for (int j = 0; j < g[d].size(); ++j)
if (!marked[g[d][j]]) {
v.push_back(g[d][j]);
marked[g[d][j]] = 1;
}
}
++cnt;
}
printf("%d\n", cnt - 1);
}
return 0;
}