PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
来源:互联网 发布:奥尼尔vs乔丹数据 编辑:程序博客网 时间:2024/06/13 21:53
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
代码:
(1)图的遍历(dfs)
#include <cstdio>#include <cstring>#include <vector>using namespace std;const int maxn=1005;vector<int> G[maxn];bool vis[maxn];int now;void dfs(int u){ if(u==now) return; vis[u]=true; for(int i=0;i<G[u].size();i++){ int v=G[u][i]; if(!vis[v]) dfs(v); }}int n,m,k;int main(){ scanf("%d%d%d",&n,&m,&k); for(int i=0;i<m;i++){ int a,b; scanf("%d%d",&a,&b); G[a].push_back(b); G[b].push_back(a); } for(int q=0;q<k;q++){ scanf("%d",&now); memset(vis,false,sizeof(vis)); int ans=0; for(int i=1;i<=n;i++){ if(i!=now&&!vis[i]){ dfs(i); ans++; } } printf("%d\n",ans-1); } return 0;}
(2)并查集
#include <cstdio>#include <vector>using namespace std;const int maxn=1005;vector<int> G[maxn];int tree[maxn];bool vis[maxn];int findRoot(int x){ if(tree[x]==-1) return x; else{ int tmp=findRoot(tree[x]); tree[x]=tmp; return tmp; }}int n,m,k;int main(){ scanf("%d%d%d",&n,&m,&k); for(int i=0;i<m;i++){ int a,b; scanf("%d%d",&a,&b); G[a].push_back(b); G[b].push_back(a); } int now; for(int q=0;q<k;q++){ scanf("%d",&now); for(int i=1;i<=n;i++){ tree[i]=-1; vis[i]=false; } for(int i=1;i<=n;i++){ for(int j=0;j<G[i].size();j++){ int u=i,v=G[i][j]; if(u==now||v==now) continue; u=findRoot(u); v=findRoot(v); if(u!=v) tree[u]=v; } } int ans=0; for(int i=1;i<=n;i++){ if(i==now) continue; int v=findRoot(i); if(!vis[v]){ ans++; vis[v]=true; } } printf("%d\n",ans-1); } return 0;}
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- 1013. Battle Over Cities @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1013 Battle Over Cities (25)
- 1013. Battle Over Cities (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1013 Battle Over Cities
- 【PAT Advanced Level】1013. Battle Over Cities (25)
- 【PAT】【Advanced Level】1013. Battle Over Cities (25)
- PAT (Advanced) 1013. Battle Over Cities (25)
- [PAT (Advanced Level) ]1013.Battle Over Cities 解题文档
- 浙大 PAT Advanced level 1013. Battle Over Cities
- PAT (Advanced Level) 1013. Battle Over Cities (25) 并查集
- Pat(Advanced Level)Practice--1013(Battle Over Cities)
- PAT(Advanced Level) 1013 - Battle Over Cities(连通图)
- PAT 1013. Battle Over Cities (25) DFS
- 1013. Battle Over Cities (25)-PAT
- pat 1013. Battle Over Cities (25)
- windows 下安装elasticsearch
- viewpage+handler
- jQuery通过正则验证表单
- Okhttp3的工具类方法
- 深入分析Spring 与 Spring MVC容器
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- Redis设计与实现——单机数据库的实现
- CommonUtils的工具类
- TensorFlow神经网络模型软测量
- Java字符串之性能优化
- logback手册-概述
- 把jar包安装到本地仓库
- angular表单验证
- laravel框架的基础学习路线(不带composer的)