题目
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 Specification:
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 Specification:
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>
int visited[1001];
int map[1001][1001]={0};
int N;
void getBlockAmount(int n);
int main()
{
int M,K;
int concernCity;
int i,j,x,y,r;
scanf("%d %d %d",&N,&M,&K);
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)
{
map[i][j]=0;
map[j][i]=0;
}
}
for(i=0;i<M;i++)
{
scanf("%d %d",&x,&y);
map[x][y]=1;
map[y][x]=1;
}
for(i=0;i<K;i++)
{
scanf("%d",&concernCity);
for(j=1;j<=N;j++)
{
visited[i]=0;
}
r=0;
visited[concernCity]=1;
for(j=1;j<=N;j++)
{
if(visited[j]==0)
{
r++;
getBlockAmount(j);
}
}
printf("%d\n",r-1);
}
return 0;
}
void getBlockAmount(int n)
{
visited[n]=1;
int i;
for(i=1;i<=N;i++)
{
if(visited[i]==0&&map[n][i]==1)
getBlockAmount(i);
}
}
感觉没什么问题,但是就是过不了,只有最后一个过了,前面的没过。