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 3 1 2 1 3 1 2 3Sample Output
1 0 0
——————————
设计的知识点为
1,图的简历
2,图的dfs
这里面主要是找删除之后孤岛有几个。。。。。。然后就是要修建的为其-1
#include <iostream>
#include <queue>
#include <stdlib.h>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define MAX 1010
struct Graph
{
int matrix[MAX][MAX];
int Num;
bool visited[MAX];
};
Graph *g;
void dfs(int begin)
{
g->visited[begin]=true;
int i;
for(i=1; i<=g->Num; i++)
{
if(!g->visited[i] && g->matrix[i][begin]==1)
{
dfs(i);
}
}
}
int main(int argc, char** argv) {
int N,M,K;
int i=0;
int res=0;
//Graph *g;
cin>>N>>M>>K;
g=(Graph *)malloc(sizeof(struct Graph));
g->Num=N;
for(i=1; i<=N; i++) g->visited[i]=false;
for(i=0; i<M; i++)
{
int c1,c2;
cin>>c1>>c2;
g->matrix[c1][c2]=g->matrix[c2][c1]=1;
}
for(int i=0; i<K; i++)
{
for(int ki=1; ki<=N; ki++) g->visited[ki]=false;
res=0;
int lost=0;
cin>>lost;
g->visited[lost]=true;
for(int j=1; j<=N; j++)
{
if(!g->visited[j])
{
dfs(j);
res++;
}
}
cout<<res-1<<endl;
}
return 0;
}