1013. Battle Over Cities (25)

#include<cstdio>
#include<cstring>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<cctype>
#include<vector>
#include<iomanip>
#include<queue>
#include<cassert>
#define INF 0x3f3f3f3f
#define max(x,y) x > y ? x : y
using namespace std;
bool map[1007][1007];
bool visited[10007];
void DFS(int n, int v){
visited[v] = 1;
for(int i = 1; i <= n; i ++){
if(map[v][i] && !visited[i]){
DFS(n,i);
}
}
}
int DFS_Traverse(int n, int v){
memset(visited,0,sizeof(visited));
visited[v] = 1;
int ans = 0;
for(int i = 1; i <= n; i ++){
if(!visited[i]) DFS(n, i), ans ++;
}
return ans;
}


int main(){
memset(map,0,sizeof(map));

int n, m, k, p, q, c;
cin>>n>>m>>k;
for(int i = 0; i < m; i ++){
cin>>p>>q;
map[p][q] = 1;
map[q][p] = 1;
}
for(int i = 0; i < k; i ++){
cin>>c;
cout<<DFS_Traverse(n, c) - 1<<endl;
}

}