PAT 甲级 1013. Battle Over Cities (25)
来源:互联网 发布:eml文件 mac 编辑:程序博客网 时间:2024/06/10 18:46
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
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
For each of the K cities, output in a line the number of highways need to be repaired if that city is lost.
Sample Input3 2 31 21 31 2 3Sample Output
100
ps:连通分量数-1
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<algorithm>using namespace std;int map[1001][1001] = { 0 };bool v[1001];int n;void dfs(int node) {v[node] = true;for (int i = 1; i <= n; i++) {if (v[i] == false && map[node][i] == 1)dfs(i);}}int main() {int m, k,a;scanf("%d%d%d", &n, &m, &k);for (int i = 0; i < m; i++) {int a, b;scanf("%d%d", &a, &b);map[a][b] = 1;map[b][a] = 1;}for (int i = 0; i < k; i++) {fill(v, v + 1001, false);scanf("%d", &a);int cnt = 0;v[a] = true;for (int j = 1; j <= n; j++) {if (v[j] == false) {dfs(j);cnt++;}}printf("%d\n", cnt - 1);}return 0;}
- 【PAT甲级】1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25) PAT甲级
- PAT甲级1013. Battle Over Cities (25)
- PAT甲级 1013. Battle Over Cities (25)
- PAT 甲级 1013. Battle Over Cities (25)
- PAT 甲级1013. Battle Over Cities
- PAT 甲级 1013. Battle Over Cities
- PAT 甲级 1013. Battle Over Cities
- [PAT-甲级]1013.Battle Over Cities
- PAT甲级A1013. Battle Over Cities (25)
- PAT甲级练习1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities (25) DFS
- 1013. Battle Over Cities (25)-PAT
- pat 1013. Battle Over Cities (25)
- 【PAT】1013. Battle Over Cities (25)
- PAT: 1013. Battle Over Cities (25)
- PAT A 1013. Battle Over Cities (25)
- pat 1013. Battle Over Cities (25)
- Android 通知栏
- 友好城市(动态规划,排序)
- 《小马SpringBoot框架》介绍与安装
- Docker下HBase学习,三部曲之一:极速体验
- 去上海面试Java外包工作的郁闷
- PAT 甲级 1013. Battle Over Cities (25)
- docker部署php+nginx环境
- php判断json格式是否正确
- Java设计模式
- ng-repeat指令中使用track by子语句解决重复数据遍历的错误
- cp复制提示问题
- SDUT 数论基础 F
- Ubuntu 设置自定义分辨率
- Unity 渲染教程(二):着色器基础