1013. Battle Over Cities (25)
来源:互联网 发布:网络监控录像机安装 编辑:程序博客网 时间:2024/06/05 05:07
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
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
IDEA
本题目的意思是,给定一张图,去掉其中的一条边和与该点相连的所有边,求至少增加几条边使得现有图连通
CODE
#include<iostream>using namespace std;#define MAX 1001int road[MAX][MAX];int visit[MAX];int n,m,k;void init(){for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){road[i][j]=0;}}}void dfs(int t){visit[t]=1;for(int i=1;i<=n;i++){if(!visit[i]&&road[i][t]){dfs(i);}}}int main(){cin>>n>>m>>k;init();for(int i=1;i<=m;i++){int c1,c2;cin>>c1>>c2;road[c1][c2]=road[c2][c1]=1;}while(k--){int query;cin>>query;int count=0;for(int i=1;i<=n;i++){visit[i]=0;}visit[query]=1;for(int i=1;i<=n;i++){if(!visit[i]){dfs(i);count++;}}cout<<count-1<<endl;}return 0;}
0 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)
- Spring Tool Suite工具关于如何使用git版本控制工具说明
- Swift Name Mangling - Swift语言的名字重整技术
- html+css上传文件控件美化
- gradlew的用法
- leetcode---ZigZag Conversion
- 1013. Battle Over Cities (25)
- ajax跨域请求
- Win10可用的Microsoft SQL Server 2008 Native Client 32和64位
- date d
- photon Unity RPC 调用流程
- 手指触摸滑动物体带惯性的旋转 以及放大缩小(用插件easytouch 控制物体的旋转和缩放)
- PYTHON-基础-时间日期处理小结
- Spark性能优化第九季之Spark Tungsten内存使用彻底解密
- matplotlib可视化教程 :绘制有关Turmp, Clinton 和Sanders的推特信息