1013. Battle Over Cities (25)——PAT (Advanced Level) Practise
2014-09-25 17:50
525 查看
题目信息:
时间限制
400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 Input
Sample Output
代码如下:
1013. Battle Over Cities (25)
时间限制400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 Input
3 2 3 1 2 1 3 1 2 3
Sample Output
1 0 0
代码如下:
#include <stdio.h> #include <memory.h> char map[1000][1000]; char vis[1000]; void dfs(int a, int N) { vis[a] = 1; for (int i = 1; i <= N; ++i) { if (0 == vis[i] && map[a][i]) dfs(i, N); } } int main() { int N, M, K; scanf("%d%d%d", &N, &M, &K); int a, b, i; for (i = 1; i <= M; ++i) { scanf("%d%d", &a, &b); map[a][b] = map[b][a] = 1; } for (i = 0; i < K; ++i) { scanf("%d", &a); memset(vis, 0, sizeof(vis)); vis[a] = 1; b = 0; for (int j = 1; j <= N; ++j) { if (0 == vis[j]) { dfs(j, N); ++b; } } printf("%d\n", b-1); } return 0; }
相关文章推荐
- 1028. List Sorting (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise - 1002. A+B for Polynomials (25)
- PAT (Advanced Level) Practise 1093 Count PAT's (25)
- PAT (Advanced Level) Practise 1062 Talent and Virtue (25)
- PAT (Advanced Level) Practise 1043 Is It a Binary Search Tree (25)
- PAT (Advanced Level) Practise - 1094. The Largest Generation (25)
- PAT (Advanced Level) Practise 1010. Radix (25)
- PAT (Advanced Level) Practise 1029. Median (25)
- PAT (Advanced Level) Practise 1085 Perfect Sequence (25)
- PAT (Advanced Level) Practise 1105 Spiral Matrix (25)
- PAT (Advanced Level) Practise 1003. Emergency (25)
- 1021. Deepest Root (25) @ PAT (Advanced Level) Practise
- 1029. Median (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise - 1003. Emergency (25)
- PAT (Advanced Level) Practise 1094 The Largest Generation (25)
- PAT (Advanced Level) Practise 1044 Shopping in Mars (25)
- PAT (Advanced Level) Practise 1040 Longest Symmetric String (25)
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- PAT (Advanced Level) Practise - 1093. Count PAT's (25)
- PAT (Advanced Level) Practise 1002 A+B for Polynomials (25)