A1013. Battle Over Cities (25)

 

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 city₁-city₂ and city₁-city₃. Then if city₁ is occupied by the enemy, we must have 1 highway repaired, that is the highway city₂-city₃.

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

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <stack> 
#include <queue>
#include <vector>
using namespace std;
const int maxn=1010;
int father[maxn];
int vis[maxn];
int n,m,k; 
vector<int> G[maxn];
void init()
{
    for(int i=1;i<maxn;i++)
    {
        father[i]=i;
        vis[i]=false;
    }
 } 
 int isFather(int x)
 {
     int tmp=x;
     while(x!=father[x])
     {
      x=father[x];    
    }
    //至此，x为所在集合的根 
    while(tmp!=father[tmp])
    {
        int z=tmp;
        tmp=father[tmp];
        father[z]=x;
    }
    return x;
 }
 
void Union(int a,int b)
{
      int fa=isFather(a);
    int fb=isFather(b);
    if(fa!=fb)
    {
        father[fa]=fb;
     } 
} 



int main(){
  scanf("%d%d%d",&n,&m,&k);
  for(int i=0;i<m;i++)
  {
      int c1,c2;
      scanf("%d %d",&c1,&c2);
      G[c1].push_back(c2);
      G[c2].push_back(c1);
  }
  for(int i=0;i<k;i++)
  {
      int tmp;
      scanf("%d",&tmp);
      //消除tmp点的相连边，之后计算分隔的块数，就可以求得所有的repair边
    //遍历 
    init();
    //合并集合
    for(int i=1;i<=n;i++)
    {
       for(int j=0;j<G[i].size();j++)
       {
           int v=G[i][j];
           if(v!=tmp&&i!=tmp)Union(i,v);
       }    
    }
    
    int  block=0;
    for(int i=1;i<=n;i++)
    {
        if(i==tmp)continue;
        if(i==father[i])block++;
     } 
     printf("%d
",block-1);
  }
  return 0;
}