PAT.A1013 Battle Over Cities

本文介绍了一种算法,用于确定在某个城市被敌军占领后,为了保持其余城市之间的连接,需要修复多少条高速公路。通过输入城市数量、剩余高速公路数量及关注的城市,算法能够快速计算出每个城市丢失后所需的修复工作。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 Mlines 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<queue>
#include<map>
#include<string>
#include<cstring>
using namespace std;
const int maxn = 1010;
int n, m, k,sum;
int edge[maxn][maxn] = { 0 }, tmp[maxn][maxn] = { 0 };
bool vist[maxn] = { false };
void dfs(int u) {
	vist[u] = true;
	for (int i = 1; i <= n; i++) {
		if (!vist[i] && tmp[u][i])
			dfs(i);
	}
}
void dfstra() {
	for (int i = 1; i <= n; i++) {
		if (!vist[i]) {
			dfs(i);
			sum++;
		}
	}
}
int main() {
	int a1, a2,b;
	scanf("%d%d%d", &n, &m, &k);
	for (int i = 0; i < m; i++) {
		scanf("%d%d", &a1, &a2);
		edge[a1][a2] = 1;
		edge[a2][a1] = 1;
	}
	for (int i = 0; i < k; i++) {
		scanf("%d", &b);
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++)
				tmp[i][j] = edge[i][j];
		}
		for (int j = 1; j <=n; j++) {
			vist[b] = true;
			tmp[b][j] = 0;
			tmp[j][b] = 0;
		}
		sum = 0;
		dfstra();
		memset(vist, false, sizeof(vist));
		if (sum > 0) sum -= 1;
		printf("%d\n", sum);
			
	}
	return 0;
}

 

基于开源大模型的教学实训智能体软件,帮助教师生成课前备课设计、课后检测问答,提升效率与效果,提供学生全时在线练习与指导,实现教学相长。 智能教学辅助系统 这是一个智能教学辅助系统的前端项目,基于 Vue3+TypeScript 开发,使用 Ant Design Vue 作为 UI 组件库。 功能模块 用户模块 登录/注册功能,支持学生和教师角色 毛玻璃效果的登录界面 教师模块 备课与设计:根据课程大纲自动设计教学内容 考核内容生成:自动生成多样化考核题目及参考答案 学情数据分析:自动化检测学生答案,提供数据分析 学生模块 在线学习助手:结合教学内容解答问题 实时练习评测助手:生成随练题目并纠错 管理模块 用户管理:管理员/教师/学生等用户基本管理 课件资源管理:按学科列表管理教师备课资源 大屏概览:使用统计、效率指数、学习效果等 技术栈 Vue3 TypeScript Pinia 状态管理 Ant Design Vue 组件库 Axios 请求库 ByteMD 编辑器 ECharts 图表库 Monaco 编辑器 双主题支持(专业科技风/暗黑风) 开发指南 # 安装依赖 npm install # 启动开发服务器 npm run dev # 构建生产版本 npm run build 简介 本项目旨在开发一个基于开源大模型的教学实训智能体软件,帮助教师生成课前备课设计、课后检测问答,提升效率与效果,提供学生全时在线练习与指导,实现教学相长。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值