【PAT】1013. Battle Over Cities (25)
来源:互联网 发布:身份证psd源码 编辑:程序博客网 时间:2024/06/11 15:41
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分析:建图,bfs查有x连通图,则需相应x-1条路;
细节:400ms足够;
#include <iostream>#include <string>#include <cstdio>#include <cmath>#include <queue>#include <vector>#include <functional>#define rep(i,j,k) for(int i=j;i<=k;++i)const int Max=1001;using namespace std;struct vertex{vector<int> edge;}ver[Max];int visited[Max];void build(int n){while(n--){int a,b;cin>>a>>b;ver[a].edge.push_back(b);ver[b].edge.push_back(a);}}void bfs(int v, int t){queue<int> q;q.push(v);visited[v]=1;while(!q.empty()){v=q.front();q.pop();int size=ver[v].edge.size();rep(i,0,size-1){int w=ver[v].edge[i];if (visited[w]==0 && w!=t){q.push(w);visited[w]=1;}}}}int check(int n, int t){rep(i,0,n) visited[i]=0;int res=0;rep(i,1,n){if (visited[i]==0 && i!=t) {bfs(i,t);++res;}}return res-1;}void print(int n, int k){rep(i,1,k){int x;cin>>x;int res=check(n,x);cout<<res<<endl;}}int main(){//freopen("test.txt","r",stdin);int n,m,k;cin>>n>>m>>k;build(m);print(n,k); return 0;}
- PAT 1013. Battle Over Cities (25) DFS
- 1013. Battle Over Cities (25)-PAT
- pat 1013. Battle Over Cities (25)
- 【PAT】1013. Battle Over Cities (25)
- PAT: 1013. Battle Over Cities (25)
- PAT A 1013. Battle Over Cities (25)
- pat 1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities (25)
- PAT-A 1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities (25)
- 【PAT甲级】1013. Battle Over Cities (25)
- PAT A 1013. Battle Over Cities (25)
- PAT(A) - 1013. Battle Over Cities (25)
- 1013. Battle Over Cities (25) PAT甲级
- 安卓-ListView基本使用
- spring mvc 框架搭建及详解
- 【JavaEE】经典JAVA EE企业应用实战-读书笔记11
- a标签跳转锚点到页面指定位置
- lwip之数据包pbuf
- 【PAT】1013. Battle Over Cities (25)
- openCV + Python 配置问题,同时 配置 pip 和安装Python相关的库 即 那个 whl 文件
- 给UIImage添加外边框圆
- u-boot源码下载地址和内核源码下载地址
- windows系统下安装ElasticSearch
- Elasticsearch1.7.3安装、配置
- netfilter中hook函数返回值详解
- Ubuntu 16.04安装有道词典
- JAVA BIO和NIO及简单实现