【PAT】【Advanced Level】1013. Battle Over Cities (25)
来源:互联网 发布:linux 加载u盘 编辑:程序博客网 时间:2024/06/05 07:30
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
原题链接:
https://www.patest.cn/contests/pat-a-practise/1013
思路:
求无向图双联通分量的个数
数据范围较弱,DFS可过
CODE:
#include<iostream>#include<vector>#include<cstring>#define N 2010using namespace std;vector<int> E[N];bool fl[N];int n,m,k;int res=0;void dfs(int no,int forb){ //cout<<no<<endl; fl[no]=1; for (int i=0;i<E[no].size();i++) { int nt; nt=E[no][i]; if (fl[nt]==1 || nt==forb) continue; dfs(nt,forb); } return ;}int main(){ cin>>n>>m>>k; for (int i=0;i<m;i++) { int u; int v; cin>>u>>v; E[u].push_back(v); E[v].push_back(u); } //for (int i=1;i<=n;i++)cout<<E[i].size()<<endl; for (int i=0;i<k;i++) { int che; cin>>che; res=0; memset(fl,0,sizeof(fl)); for (int j=1;j<=n;j++) { if (fl[j]==1 || j==che) continue; res++; //cout<<j<<" "<<che<<endl; dfs(j,che); } cout<<res-1<<endl; } return 0;}
- 【PAT Advanced Level】1013. Battle Over Cities (25)
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- 【PAT】【Advanced Level】1013. Battle Over Cities (25)
- PAT (Advanced Level) Practise 1013. Battle Over Cities (25)
- PAT (Advanced) 1013. Battle Over Cities (25)
- 1013. Battle Over Cities @ PAT (Advanced Level) Practise
- [PAT (Advanced Level) ]1013.Battle Over Cities 解题文档
- 浙大 PAT Advanced level 1013. Battle Over Cities
- PAT (Advanced Level) Practise 1013 Battle Over Cities (25)
- 1013. Battle Over Cities (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) 1013. Battle Over Cities (25) 并查集
- Pat(Advanced Level)Practice--1013(Battle Over Cities)
- PAT(Advanced Level) 1013 - Battle Over Cities(连通图)
- PAT (Advanced Level) Practise 1013 Battle Over Cities
- PAT 1013. Battle Over Cities (25) DFS
- 1013. Battle Over Cities (25)-PAT
- pat 1013. Battle Over Cities (25)
- Mybatis 之List<?>传参的注意事项和原理
- Source Insight4.0问题总结
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)-831C Jury Marks(思维)
- C语言的奇技淫巧
- hdu1711 KMP
- 【PAT】【Advanced Level】1013. Battle Over Cities (25)
- 详解C中volatile关键字
- C++案例分析
- day05(数组)
- Android自定义万能Canvas画布
- Excel比较工具SpreadSheet
- Android开发中如何设置字体
- 【PAT】【Advanced Level】1014. Waiting in Line (30)
- sort