1013. Battle Over Cities (25)
来源:互联网 发布:2016淘宝经营技巧 编辑:程序博客网 时间:2024/05/29 23:23
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
#include <iostream>#include <map>#include <string>#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>using namespace std;bool edge[1000][1000];bool v[1000];int n,m,k;void initMap(){ int i,j; for(i = 1; i <=n ;++i){ for(j = 1; j <= n; ++j) edge[i][j] = false; }}void initV(){ for(int i = 1; i <= n; ++i){ v[i] = false; }}void dfs(int index, int NO){ v[index] = true; for(int i = 1; i <= n; ++i){ if(!v[i] && edge[index][i] && i != NO){ dfs(i,NO); } }}int main(int argc, char* argv[]){ int i,j,s,e,index; int count = 0; scanf("%d%d%d",&n,&m,&k); initMap(); for(i = 1; i <= m; i++){ scanf("%d%d",&s,&e); edge[s][e] = edge[e][s] = true; } while(k--){ scanf("%d",&index); count = 0; initV(); for(i = 1; i <= n; ++i){ if( !v[i] && i!=index) { count++; dfs(i,index); } } printf("%d\n",count-1); } 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)
- Android 获取网络数据(使用fastjson-1.2.3.jar 包)
- PHP实现微信支付(jsapi支付)流程
- 多态、虚函数表、对象模型
- 1012. The Best Rank (25)
- 微信上传图片接口报{"errMsg":"uploadImage:missing arguments"}错误
- 1013. Battle Over Cities (25)
- STL容器学习总结
- Bean 的生命周期
- PHP判断某年的某月有多少天
- 3. Unsupervised Learning
- kotlin编《第一行代码》(1)
- 进制的转换
- webshell的实现与隐藏
- DC