PAT真题练习（甲级）1013 Battle Over Cities (25 分)

最新推荐文章于 2025-09-25 09:18:49 发布

原创最新推荐文章于 2025-09-25 09:18:49 发布 · 250 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++

刷题笔记专栏收录该内容

33 篇文章

订阅专栏

本文详细解析PAT甲级竞赛中一道关于高速公路网络修复的算法题目。在战争背景下，若某城市被敌方占领，所有进出该城市的高速公路将关闭。为保持其余城市间的连接，必须迅速判断并修复必要高速公路。文章通过具体实例，介绍了如何使用深度优先搜索（DFS）算法确定修复需求，并提供完整代码实现。

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

#include<iostream>
#include <string>
#include <stdio.h>
#include <memory.h>
using namespace std;

bool visited[1000];
bool roads[1000][1000] = { false };
int N, M, K;

// 深度遍历图
void DFS(int node) {
	visited[node] = true;
	for (auto i = 1; i <= N;i++) {
		if (!visited[i] && roads[node][i]) {
			visited[i] = true;
			DFS(i);
		}
	}
}

int main() {
	cin >> N >> M >> K;
	int c1, c2;
	for (auto i = 0;i < M;i++) {
		cin >> c1 >> c2;
		// 注意是无向图，因此要赋值两条路
		roads[c1][c2] = true;
		roads[c2][c1] = true;
	}
	int count = 0;
	int city;
	for (auto i = 0; i < K;i++) {
		cin >> city;
		// 记得重新初始化访问数组和count值
		memset(visited, false, N + 1);
		count = 0;
		// 假设city及其所连接的边不存在
		// 求此种情况下，连通分量的个数
		// 则所需补充的边数即为连通分量的个数 - 1
		visited[city] = true;
		// 注意城市的编号是从1-N 而不是从0开始
		for (auto p = 1; p <= N;p++) {
			if (!visited[p]) {
				DFS(p);
				count++;
			}
		}
		cout << count - 1 << endl;
	}
}