Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1013. Battle Over Cities

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.


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.


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



#include <cstdio>
#include <utility>
#include <vector>
using namespace std;

int n, m, k;
vector<pair<int, int> > e;

const int mx = 1000001;
int father[mx], rnk[mx];//节点x的父亲,该子树的深度,节点个数

void makeSet ()
	for (int i = 1; i <= n; i++)	father[i] = i, rnk[i] = 0;

int findSet (int x)
	if (x != father[x])		father[x] = findSet(father[x]);
	return father[x];

int unionSet (int x, int y)
	x = findSet(x), y = findSet(y);
	if (x == y)		return 0;
	if(rnk[x] > rnk[y])	father[y] = x;
	else father[x] = y, rnk[y] += rnk[x]==rnk[y];
	return 1;

int main()
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 0, tx, ty; i < m; i++)
		scanf("%d%d", &tx, &ty), e.push_back(pair<int,int>(tx, ty));
	while (k--)
		int t, ans = n; scanf("%d", &t);
		for (int i = 0; i < m; i++)
			if (e[i].first != t && e[i].second != t)
				ans -= unionSet(e[i].first, e[i].second);
		printf("%d\n", ans-2);
上一篇: 下一篇: