PAT 1013. Battle Over Cities (25)
来源:互联网 发布:淘宝申诉ps小票 编辑:程序博客网 时间:2024/06/05 19:49
http://pat.zju.edu.cn/contests/pat-a-practise/1013
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>int Tree[1000];int findRoot(int x){if (Tree[x] == -1) return x;else{int tmp = findRoot(Tree[x]);Tree[x] = tmp;return tmp;}}struct w{int x;int y;}way[500000];int main(){int n, m, k;scanf("%d%d%d", &n, &m, &k);for (int i = 0; i < m; i++){scanf("%d%d", &way[i].x, &way[i].y);}while (k--){for (int i = 1; i <= n; i++)Tree[i] = -1;int c;scanf("%d", &c);for (int i = 0; i < m; i++){if (way[i].x != c && way[i].y != c){int rx = findRoot(way[i].x);int ry = findRoot(way[i].y);if (rx != ry){Tree[rx] = ry;}}}int group = 0;for (int i = 1; i <= n; i++){if (Tree[i] == -1)group++;}printf("%d\n", group-2);}return 0;}
DFS解法(当然还可以用BFS):
#include <cstdio>#include <cstring>#define MAX 1000int edge[MAX][MAX];int visited[MAX];int n, m, k;void dfs(int t){visited[t] = 1;for (int i = 1; i <= n; ++i){if (!visited[i] && edge[i][t] == 1)dfs(i);}}int main(){scanf("%d%d%d", &n, &m, &k);int a, b;for (int i = 0; i < m; ++i){scanf("%d%d", &a, &b);edge[a][b] = 1;edge[b][a] = 1;}int c;while (k--){int count = 0;scanf("%d", &c);memset(visited, 0, sizeof(visited));visited[c] = 1;for (int i = 1; i <= n; ++i){if (visited[i] == 0){dfs(i);count++;}}printf("%d\n", count-1);}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甲级
- NOW ! It's time to implement "FFT" !
- Log 分析:Due to heavy load, the latest workflow operation has been queued...
- 【Java.JMS】。。。
- 开始局部副本
- javascript 十六进制与RGB颜色值的相互转换
- PAT 1013. Battle Over Cities (25)
- InstallShield12-许可协议接受界面
- Converse di2G BIM XhHEZ
- Converse帆布鞋 NYrH NCL VoJvi
- Adidas NAeW ggW MubG5
- DirectX 9.0c游戏开发手记之“龙书”第二版学习笔记之1: 开场白
- <leetcode> Inorder, Preorder Traversal
- 【MacOS】Mac OS中显示和隐藏文件
- ubuntu 安装心得(UEFI win8)