博客
关于我
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_西安11月销售昨日未上架的产品_20161212
查看>>
Mysql——深入浅出InnoDB底层原理
查看>>
MySQL“被动”性能优化汇总
查看>>
MySQL、HBase 和 Elasticsearch:特点与区别详解
查看>>
MySQL、Redis高频面试题汇总
查看>>
MYSQL、SQL Server、Oracle数据库排序空值null问题及其解决办法
查看>>
mysql一个字段为空时使用另一个字段排序
查看>>
MySQL一个表A中多个字段关联了表B的ID,如何关联查询?
查看>>
MYSQL一直显示正在启动
查看>>
MySQL一站到底!华为首发MySQL进阶宝典,基础+优化+源码+架构+实战五飞
查看>>
MySQL万字总结!超详细!
查看>>
Mysql下载以及安装(新手入门,超详细)
查看>>
MySQL不会性能调优?看看这份清华架构师编写的MySQL性能优化手册吧
查看>>
MySQL不同字符集及排序规则详解:业务场景下的最佳选
查看>>
Mysql不同官方版本对比
查看>>
MySQL与Informix数据库中的同义表创建:深入解析与比较
查看>>
mysql与mem_细说 MySQL 之 MEM_ROOT
查看>>
MySQL与Oracle的数据迁移注意事项,另附转换工具链接
查看>>
mysql丢失更新问题
查看>>
MySQL两千万数据优化&迁移
查看>>