1013 Battle Over Cities (25)(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 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 Specification:
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 Specification:
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
思路:
用并查集来做。每次去掉需要check的那个城市对应的边,然后看有多少个连通图,需要修建的路条数是连通图个数-1。顺便说一句,用cin的话最后一个测试点会超时,所以最好用scanf。
代码:
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
struct highway
{
int x, y;
};
highway highways[1000 * 1000];
int n, m, k;
int f[1000];
void Init()
{
for (int i = 1; i <= n; i++)
f[i] = i;
}
int Find(int x)
{
if (x != f[x])
f[x] = Find(f[x]);
return f[x];
}
void Union(int x, int y)
{
int a = Find(x);
int b = Find(y);
if (a != b)
f[a] = b;
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < m; i++)
scanf("%d%d", &highways[i].x, &highways[i].y);
for (int i = 0; i < k; i++)
{
int city;
scanf("%d", &city);
Init();
for (int j = 0; j < m; j++)
{
if (highways[j].x == city || highways[j].y == city)
continue;
Union(highways[j].x, highways[j].y);
}
int ans = 0;
for (int j = 1; j <= n; j++)
{
if (j != city && f[j] == j)
ans++;
}
printf("%d\n", ans - 1);
}
return 0;
}