PAT 1013 Battle Over Cities(并查集)

1013. Battle Over Cities (25)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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 city1-city2 and city1-city3. Then if city1 is occupied by the enemy, we must have 1 highway repaired, that is the highway city2-city3.

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 <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#include <strstream>
#include <map>

using namespace std;
struct Node
{
    int x;
    int y;
}edge[1005*1005];
int father[10005];
int find(int x)
{
    if(father[x]!=x) father[x]=find(father[x]);
    return father[x];
}
int n,m,k;
int a;
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=m;i++)
        scanf("%d%d",&edge[i].x,&edge[i].y);

    for(int i=1;i<=k;i++)
    {
        scanf("%d",&a);
        for(int j=1;j<=n;j++)
            father[j]=j;
        for(int j=1;j<=m;j++)
        {
            if(edge[j].x==a||edge[j].y==a)
                continue;
            int fx=find(edge[j].x);
            int fy=find(edge[j].y);
            if(fx!=fy)
                father[fx]=fy;
        }
        int ans=0;
        for(int j=1;j<=n;j++)
        {
            if(j==a) continue;
            find(j);
            if(father[j]==j)
                ans++;
        }
        printf("%d\n",ans-1);
    }
    return 0;

}



阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Dacc123/article/details/51539759
个人分类: pat 并查集
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

PAT 1013 Battle Over Cities(并查集)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭