1013. Battle Over Cities (25)
来源:互联网 发布:数据机房图片 编辑:程序博客网 时间:2024/06/10 00:13
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
提交代码
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <string>#include <cmath>using namespace std;int n,m,k;int map[1010][1010];int book[1010];void dfs(int node){for(int i = 1;i <= n;i++)//对于dfs后面对数,函数中的函数就不一定在node+1后面找了 {if(book[i]==-1){if(map[node][i]==1){book[i]=1; dfs(i);} } }}int main(){cin >> n >> m >> k;while(m--){int x,y;cin >> x >> y;map[x][y] = 1;map[y][x] = 1;}int c,ans;while(k--){memset(book,-1,sizeof(book));cin >> c;book[c]=0;ans=0;for(int i = 1;i <= n;i++){if(book[i] == -1) {ans++;book[i] = 1;dfs(i);}}printf("%d\n",ans-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)
- python happyhbase 访问报错解决方案
- sso单点登录基础篇
- 【游戏开发3D数学笔记】5.方位与角位移
- MYSQL入门
- Java,面试题,将阿拉伯数字转为中文
- 1013. Battle Over Cities (25)
- Windows7下安装Linux双操作系统
- Maven及IDEA中Maven的配置
- 动态规划——求数字三角形最优解和最优路径
- CNN卷积神经网络新想法
- 大数乘法(模板)
- 封装高可复用的服务端响应对象和登录demo
- HDU 3763 CD(二分查找)
- C和指针之字符串之strncpy、strncat、strncmp