1013. Battle Over Cities (25)
题目:
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
题目描述:
给你一张图,去除图中的一个顶点,问至少需要几条边可以将剩下的顶点连通。
分析
本质上就是求连通块的个数,连通块的个数减一就是需要增加的边数。求连通块可以采用 DFS 或 并查集。
代码
//DFS
#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 1000 + 5;
int G[maxn][maxn]; //邻接矩阵保存图
bool visit[maxn]; //顶点访问标记数组
int n; //顶点个数
void dfs(int s){
visit[s] = true;
for(int i = 1;i <= n;i++){
if(!visit[i] && G[s][i] > 0) //如果当前顶点没有被访问并且与源点 s 有边
dfs(i);
}
}
int main(void){
ios::sync_with_stdio(false);
int m,k;
int c1,c2;
cin>>n>>m>>k;
for(int i = 0;i < m;i++){
cin>>c1>>c2;
G[c1][c2] = G[c2][c1] = 1;//无向图
}
int temp;
for(int i = 0;i < k;i++){
int cnt = 0;
cin>>temp;
memset(visit,false,sizeof(visit));
visit[temp] = true;
for(int i = 1;i <= n;i++){
if(!visit[i]){
dfs(i);
cnt++; //连通块个数加一
}
}
cout<<cnt-1<<endl;
}
}