1013 Battle Over Cities (25 分)

#include<bits/stdc++.h>
using namespace std;
bool visited[1001] = {false};
map<int ,vector<int> > graph;

void BFS(int node){
    visited[node] = true;
    for(int i = 0 ; i < graph[node].size() ; i++){
        if(!visited[graph[node][i]])
            BFS(graph[node][i]);
    }
}
int main(){
    int n , m ,k;
    cin>>n>>m>>k;
    for(int i = 0 ; i < m ; i++){
        int start ,end;
        cin>>start>>end;
        graph[start].push_back(end);
        graph[end].push_back(start);
    }
    int counter = 0;
    for(int j = 0 ; j < k ; j++){
        int k1;
        cin>>k1;
        visited[k1] = true;
        for(int i = 1 ; i <= n ; i++){            
            if(!visited[i]){
                counter++;
                BFS(i);
            }
        }
        printf("%d",counter-1);
        if(j!=k-1)
            printf("\n");
        counter = 0;
        fill(visited,visited+n+1,false);
    }
}