PAT 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 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​1​​-city​2​​ and city​1​​-city​3​​. Then if city​1​​ is occupied by the enemy, we must have 1 highway repaired, that is the highway city​2​​-city​3​​.

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 Knumbers, 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.

解答：这个问题也算是图问题的经典应用了，本质就是求图的连通子图数量。因为一个节点和其他点切断后，需要n-1条路才能将n个连通子图连起来，所以啊，用dfs遍历下图，看看到底有多少联通子图就行了。当然，图的存储可以有邻接矩阵和邻接链表两种，我用邻接链表实现的时候有一个超时，估计用vector有点慢，然后用邻接矩阵实现，AC！

超时代码如下:

#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>

#define maxn 1010

using namespace std;

int n, m, k;
vector<int> e[maxn];
bool visited[maxn];

void dfs(int j)
{
	visited[j] = true;
	for (int i = 0; i < e[j].size(); ++i)
	{
		int v = e[j][i];
		if (visited[v] == false)
		{
			dfs(v);
		}
	}
}
int main()
{
	//cin >> n >> m >> k;
	scanf("%d %d %d", &n, &m, &k);
	for (int i = 0; i < m; ++i)
	{
		int v1, v2;

		cin >> v1 >> v2;
		e[v1].push_back(v2);
		e[v2].push_back(v1);
	}
	for (int i = 1; i <= k; ++i)
	{
		int v;
		//cin >> v;
		scanf("%d", &v);
		fill(visited, visited + maxn, false);
		visited[v] = true;
		int count = 0;
		for (int j = 1; j <= n; ++j)
		{
			if (visited[j] == false)
			{
				dfs(j);
				count++;
			}
		}
		//cout << count-1 << endl;
		printf("%d\n", count-1);
	}
	return 0;
}

AC代码如下：

#include<iostream>
#include<algorithm>

#define maxn 1010

using namespace std;

int e[maxn][maxn];
bool visited[maxn];
int n, m, k;

void dfs(int j)
{
	visited[j] = true;

	for (int i = 1; i <= n; ++i)
	{
		if (visited[i] == false && e[j][i] == 1)
		{
			dfs(i);
		}
	}
}
int main()
{
	scanf("%d %d %d", &n, &m, &k);

	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			e[i][j] = 0;
		}
	}
	for (int i = 0; i < m; ++i)
	{
		int v1, v2;

		scanf("%d %d", &v1, &v2);
		e[v1][v2] = 1;
		e[v2][v1] = 1;
	}
	for (int i = 0; i < k; ++i)
	{
		int v;
		scanf("%d", &v);
		fill(visited, visited + n + 1, false);
		visited[v] = true;
		int count = 0;
		for (int j = 1; j <= n; ++j)
		{
			if (visited[j] == false)
			{
				dfs(j);
				count++;
			}
		}
		printf("%d\n", count - 1);
	}
	return 0;
}