博客
关于我
1013 Battle Over Cities
阅读量:429 次
发布时间:2019-03-06

本文共 2276 字,大约阅读时间需要 7 分钟。

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 (<), 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 31 21 31 2 3
 

Sample Output:

100

题意:

几个村庄联通在一起,当敌军占领一个村庄后,这个村庄与外界的联通联通路线被阻断,问要使剩下的村庄联通,需要新修建几条路线。

分析:

使用连接矩阵来表示联通的图,visited[]用来表示当前村庄是否被访问过,利用dfs()来寻找连通分量的个数,连通分量的个数-1就是所需要修建的路的条数。

 

Code:

#include
#include
#include
using namespace std;int v[1010][1010];int visited[1010];int n, k, m, c;void dfs(int node) { visited[node] = 1; for (int i = 1; i <= n; ++i) { if (visited[i] == 0 && v[node][i] == 1) { dfs(i); } }}int main() { scanf("%d%d%d", &n, &k, &m); int x, y; for (int i = 0; i < k; ++i) { scanf("%d%d", &x, &y); v[x][y] = v[y][x] = 1; } for (int i = 0; i < m; ++i) { int cnt = 0; scanf("%d", &c); fill(visited, visited+1010, 0); visited[c] = 1; for (int j = 1; j <= n; ++j) { if (visited[j] == 0) { dfs(j); cnt++; } } cout << cnt-1 << endl; } return 0;}

  

注意:

这里要使用scanf()函数来输入,如果使用cin来输入的话会超时。

 

转载地址:http://dctuz.baihongyu.com/

你可能感兴趣的文章
mysql 敲错命令 想取消怎么办?
查看>>
Mysql 整形列的字节与存储范围
查看>>
mysql 断电数据损坏,无法启动
查看>>
MySQL 日期时间类型的选择
查看>>
Mysql 时间操作(当天,昨天,7天,30天,半年,全年,季度)
查看>>
MySQL 是如何加锁的?
查看>>
MySQL 是怎样运行的 - InnoDB数据页结构
查看>>
mysql 更新子表_mysql 在update中实现子查询的方式
查看>>
MySQL 有什么优点?
查看>>
mysql 权限整理记录
查看>>
mysql 权限登录问题:ERROR 1045 (28000): Access denied for user ‘root‘@‘localhost‘ (using password: YES)
查看>>
MYSQL 查看最大连接数和修改最大连接数
查看>>
MySQL 查看有哪些表
查看>>
mysql 查看锁_阿里/美团/字节面试官必问的Mysql锁机制,你真的明白吗
查看>>
MySql 查询以逗号分隔的字符串的方法(正则)
查看>>
MySQL 查询优化:提速查询效率的13大秘籍(避免使用SELECT 、分页查询的优化、合理使用连接、子查询的优化)(上)
查看>>
mysql 查询,正数降序排序,负数升序排序
查看>>
MySQL 树形结构 根据指定节点 获取其下属的所有子节点(包含路径上的枝干节点和叶子节点)...
查看>>
mysql 死锁 Deadlock found when trying to get lock; try restarting transaction
查看>>
mysql 死锁(先delete 后insert)日志分析
查看>>