1013. Battle Over Cities (25)
来源:互联网 发布:php多文件上传代码 编辑:程序博客网 时间:2024/06/07 01:32
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 Input
3 2 3
1 2
1 3
1 2 3
Sample Output
1
0
0
模拟check的点,然后dfs检查剩下的点,
#include <iostream>#include <vector>using namespace std;const int maxn = 1010;int n, m, k;int check[maxn], visit[maxn];vector<int> ans;vector<int> edge[maxn];void dfs(int s){ visit[s] = 1; if(edge[s].empty()) return; for(int i = 0; i < edge[s].size(); ++i){ if(visit[edge[s][i]] != 1) dfs(edge[s][i]); }}int main(){ scanf("%d%d%d", &n, &m, &k); int x, y, cnt; for(int i = 0; i < m; ++i){ scanf("%d%d", &x, &y); edge[x].push_back(y); edge[y].push_back(x); } for(int i = 0; i < k; ++i) scanf("%d", check + i); for(int i = 0; i < k; ++i){ cnt = 0; visit[check[i]] = 1; for(int j = 1; j <= n; ++j){ if(visit[j] != 1){ dfs(j); ++cnt; } } ans.push_back(cnt - 1); memset(visit, 0, sizeof(visit)); } for(int i = 0; i < ans.size(); ++i) printf("%d\n", ans[i]); return 0;}
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25)
- ubuntu/wireshark下Lua: Error during loading: [string "/usr/share/wireshark/init.lua"]:45
- Android动画----ValueAnimator
- Spring Boot 配置文件介绍
- delete 类数组指针时可能出现的问题
- 我常用mysql命令
- 1013. Battle Over Cities (25)
- Linux内核内存池管理技术实现分析
- 这里主要收集各种用到的库,会不定期更新
- 02-net-surgery.ipynb
- 断言调试
- 品后感 之《中国生存启示录--梁晓声》
- 【零基础学Web】Html5学习第一天
- 【算法】程序猿不写代码是不对的1
- UICollectionView 各种间距设置