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 city
1
-city
2
and city
1
-city
3
. Then if city
1
is occupied by the enemy, we must have 1 highway repaired, that is the highway city
2
-city
3
.
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<iostream>
#include<map>
#include<vector>
#include<queue>
#include<string.h>
const int maxn =1005;
using namespace std;
vector<int> G[maxn];
bool vis[maxn]={false};
int city,n,m,k;
void dfs(int s){
if(s == city) return ;
vis[s] = true;
for(int i=0;i<G[s].size();i++){
if(!vis[ G[s][i] ])
dfs(G[s][i]);
}
}
int main(){
cin>>n>>m>>k;
cout<<m<<k<<endl;
for(int i=1;i<=m;i++){
int a,b;
cin>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
for(int i=1;i<=k;i++){
int block=0;
memset(vis,0,sizeof(vis));
cin>>city;
for(int i=1;i<=n;i++){
if(!vis[i] && i!=city){
block++;
dfs(i);
}
}
cout<<block-1<<endl;
}
return 0;
}
还可以并查集