1013. Battle Over Cities (25)
来源:互联网 发布:潮流网络 编辑:程序博客网 时间:2024/06/05 03:22
1013. Battle Over Cities (25)
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
这个题目实际上也就是在去除某个节点后,计算剩下的连通集个数n,然后需要修复的公路的数目为n-1。可以通过dfs或者bfs来对剩余的图进行遍历,这里使用dfs来进行遍历。
#include <iostream>#include <queue>using namespace std;int num_city,num_highway,k;int road[1000][1000]={0};int visited[1000]={0};void dfs(int city);int main(){ queue<int> q; cin >>num_city >>num_highway >>k; for(int i=0;i<num_highway;i++) { int a,b; cin >>a >>b ; road[a][b]=road[b][a]=1; } for(int i=0;i<k;i++) { int a; cin >>a; q.push(a); } int cnt=-1; for(int i=0;i<k;i++) { int occupied=q.front(); q.pop(); visited[occupied]=1; for(int j=1;j<num_city+1;j++) { if(visited[j]!=1) { visited[j]=1; dfs(j); cnt++; } } cout <<cnt <<endl; cnt=-1; for(int i=1;i<num_city+1;i++) visited[i]=0; } return 0;}void dfs(int city){ for(int i=1;i<num_city+1;i++) { if(visited[i]!=1 && road[city][i]==1) { visited[i]=1; dfs(i); } }}
- 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)
- HDU 1004:Let the Balloon Rise【STl】
- 修改整个Tableview的背景色
- 欢迎使用CSDN-markdown编辑器
- Android开发学习之路--RxAndroid之lambda
- 蓝桥杯--2012--取球游戏
- 1013. Battle Over Cities (25)
- 关于数组的两个要点
- python第三方库PIL学习
- DLL的进入退出——由DLL_PROCESS_ATTACH而联系搜索起来。
- 秒杀系统设计详解
- oozie4.3.0安装过程(支持python spark action)
- 手机看图软件,安卓,ios浏览编辑DWG
- 清除Swap空间
- define.pch