PAT 甲级 1013. Battle Over Cities
来源:互联网 发布:张靓颖 冯轲 知乎 编辑:程序博客网 时间:2024/06/03 21:01
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<bits/stdc++.h>using namespace std;int fa[1024];int Find(int a){ return a == fa[a]?fa[a]:fa[a] = Find(fa[a]);}vector<pair<int,int> > e;int main(){ int m,n,k; scanf("%d%d%d",&n,&m,&k); for(int i = 0;i < m;i++) { int a,b; scanf("%d%d",&a,&b); e.push_back(make_pair(a,b)); } while(k--) { for(int i = 1;i <= n;i++) fa[i] = i; int tmp; scanf("%d",&tmp); for(int i = 0;i < m;i++) { int a = e[i].first; int b = e[i].second; if(a == tmp||b == tmp) continue; a = Find(a); b = Find(b); if(a != b) fa[a] = b; } int ans = 0; for(int i = 1;i <= n;i++) if(fa[i] == i) ans++; printf("%d\n",ans-2); } return 0;}
- 【PAT甲级】1013. Battle Over Cities (25)
- PAT 甲级1013. Battle Over Cities
- 1013. Battle Over Cities (25) PAT甲级
- PAT甲级1013. Battle Over Cities (25)
- PAT 甲级 1013. Battle Over Cities
- PAT 甲级 1013. Battle Over Cities
- PAT甲级 1013. Battle Over Cities (25)
- [PAT-甲级]1013.Battle Over Cities
- PAT 甲级 1013. Battle Over Cities (25)
- PAT甲级练习1013. Battle Over Cities (25)
- PAT甲级A1013. Battle Over Cities (25)
- PAT 1013. Battle Over Cities
- PAT 1013. Battle Over Cities
- PAT 1013. Battle Over Cities
- PAT 1013. Battle Over Cities
- PAT 1013. Battle Over Cities
- 【PAT】1013. Battle Over Cities
- [PAT]Battle Over Cities
- 剑指offer面试题[17]-合并两个排序的链表
- 178.Rank_Scores
- 机器学习之numpy和matplotlib学习(八)
- 无题
- 快速了解Jmeter
- PAT 甲级 1013. Battle Over Cities
- mybatis的二级缓存
- 提取docx转为txt后的文件内容
- NO.1 BF(Brute Froce),MP
- 高效率科研神器——小软件、大能量
- 最详细的Log4j使用教程
- 什么是线程安全
- 剑指offer C++
- java环境配置