PAT 1013 Battle Over Cities(并查集)

原创 2016年05月30日 17:35:06

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;

}



版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

PAT (Advanced Level) 1013. Battle Over Cities (25) 并查集

It is vitally important to have all the cities connected by highways in a war. If a city is occupied...

九度OJ 1325:Battle Over Cities(城市间的战争) (并查集)

时间限制:1 秒 内存限制:32 兆 特殊判题:否 提交:376 解决:132 题目描述: It is vitally important to hav...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

1013. Battle Over Cities (25)——PAT (Advanced Level) Practise

题目信息: 1013. Battle Over Cities (25) 时间限制 400 ms 内存限制 32000 kB 代码...

PAT_1013.Battle Over Cities

//1013. Battle Over Cities (25) // //时间限制 //400 ms //内存限制 //65536 kB //代码长度限制 //16000 B //判题程序 //Sta...

PAT 甲级 1013. Battle Over Cities

1013. Battle Over Cities (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 160...

PAT1013. Battle Over Cities (25)

题目如下: It is vitally important to have all the cities connected by highways in a war. If a city ...

PAT (Advanced Level) Practise 1013. Battle Over Cities (25)

1013. Battle Over Cities (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 160...

PAT 1013. Battle Over Cities (25)

1013. Battle Over Cities (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 160...

PAT 1013. Battle Over Cities (25)

//1013. Battle Over Cities (25) //这道题主要思路是,删除了某个城市节点后,剩下的城市可以分作几部分(假设N部分),则需要组成的路线是N-1就可以将所有城市相连。 //...

PAT 甲级 1013. Battle Over Cities

原题传送门 题意:从一个无向图里,取出一个顶点,至少要补几条边能够使得它联通。 思路:就相当于求它的连通分量x,需要连x-1条边。 #include #include #include usin...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)