pat1013 Battle Over Cities

最新推荐文章于 2024-09-14 20:30:05 发布

学代码不会秃

最新推荐文章于 2024-09-14 20:30:05 发布

阅读量93

点赞数

分类专栏： pat 文章标签：深度优先算法图论

本文链接：https://blog.csdn.net/m0_46436086/article/details/128933350

版权

pat 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

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.
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:

Sample Output:

1
0
0

笔记

最开始的思路是建立一个邻接矩阵，用DFS判断两个城市之间是否存在道路，每占领一个城市则将其城市相关联的其他城市的邻接矩阵进行更新，但是发现会很复杂，难以实现。尤其是到后期的添加几条路径更难得出来。

正确思路
通过连通分量会更加方便，最后需要加的路径就是连通分量个数-1，用DFS,每次占领一个城市就直接将它的visit设置为true，这样子可以实现这个城市的封闭，既无法从这个城市进行遍历路径，也无法经过。

代码

#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 1005

int N, M, K;
int road[MAXSIZE][MAXSIZE];
int is_visited[MAXSIZE];

void DFS(int n)
{
	is_visited[n] = 1;
	for (int i = 1; i <= N; i++)
	{
		if (road[n][i] != 0 && is_visited[i] == 0)
			DFS(i);
	}
}

int is_all_visit()
{
	for (int i = 1; i <= N; i++)
	{
		if (is_visited[i] == 0)
			return 0;
	}
	return 1;
}

int main(void)
{
	scanf("%d %d %d", &N, &M, &K);
	for (int i = 0; i < M; i++)
	{
		int b, e;
		scanf("%d %d", &b, &e);
		road[b][e] = 1;
		road[e][b] = 1;
	}
	for (int i = 0; i < K; i++)
	{
		for (int i = 1; i <= N; i++)
			is_visited[i] = 0;
		int m;
		scanf("%d", &m);
		is_visited[m] = 1;
		int num = 0;
		while (!is_all_visit())
		{
			num++;
			for (int i = 1; i <= N; i++)
			{
				if (is_visited[i] == 0)
				{
					DFS(i);
					break;
				}
			}
		}
		printf("%d\n", num - 1);
	}
	system("pause");
}

```