AcWing 395. 冗余路径
解题思路:将全部点求强连通分量之后进行缩点,求这些大点的度数,只要将度数为1的大点之间建立一条新边,就能达成所有点之间都不止一条通路
#include<bits/stdc++.h>
using namespace std;
const int N = 5010, M = 30010;
int h[N], e[M], ne[M], idx;
int n, m;
int stk[N];
int low[N], dfn[N], timep, scc_cnt;
int id[N];
int top;
bool is_bridge[M];
int d[N];
int ans;
void add(int a, int b){
e[idx] = b;
ne[idx] = h[a];
h[a] = idx ++ ;
}
void tarjan(int u, int fa){
low[u] = dfn[u] = ++ timep;
stk[ ++ top] = u;
for(int i = h[u]; ~i; i = ne[i]){
int j = e[i];
if(!dfn[j]){
tarjan(j, i);
low[u] = min(low[u], low[j]);
if(dfn[u] < low[j]){ //找到一个桥
is_bridge[i] = is_bridge[i ^ 1] = true;
}
}
else if(i != (fa ^ 1)) low[u] = min(low[u], dfn[j]); //fa^1得出的是fa对应的边的反边
}
if(low[u] == dfn[u]){
int y;
++ scc_cnt;
do{
y = stk[top -- ];
id[y] = scc_cnt;
}while(y != u);
}
}
int main()
{
cin>>n>>m;
memset(h, -1, sizeof h);
for(int i = 0; i < m; i ++ ){
int a, b;
cin>>a>>b;
add(a, b);
add(b, a);
}
tarjan(1, -1);
for(int i = 0; i < idx; i ++ ){ //遍历所有边
if(is_bridge[i]){ //如果这条边是桥
d[id[e[i]]] ++ ; //边所对应的点所对应的连通块的度数++
}
}
for(int i = 1; i <= scc_cnt; i ++ ){
if(d[i] == 1){ //只有度数为1的连通块才需要加边
ans ++ ;
}
}
cout<<(ans + 1) / 2<<endl;
return 0;
}