Redundant Paths(无向图缩点, 有重边)

这个连通分量上的广义叶子节点（度数为1）除以2向上取整即为所需要加的边数

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
const int maxn = 101000;
const ll mod = 1e9 + 7;
int n, m, cnt, deep, num;
int head[maxn], col[maxn], vis[maxn], low[maxn], dfn[maxn];
stack<int> s;
struct node{
    int to;
    int next;
}edge[maxn << 1];
void add(int u, int v){
    edge[cnt].to = v;
    edge[cnt].next = head[u];
    head[u] = cnt ++;
}
void tarjan(int u, int fa){
    deep ++;
    low[u] = dfn[u] = deep;
    vis[u] = 1;
    s.push(u);
    int flag = 0;
    for(int i = head[u] ; i != -1 ; i = edge[i].next){
        int v = edge[i].to;
        if(v == fa){
            if(++ flag < 2) continue;
        }
        if(!dfn[v]){
            tarjan(v, u);
            low[u] = min(low[u], low[v]);
        }
        else{
            if(vis[v]){
                low[u] = min(low[u], dfn[v]);
            }
        }
    }
    if(dfn[u] == low[u]){
        col[u] = ++ num;
        vis[u] = 0;
        while(s.top() != u){
            col[s.top()] = num;
            vis[s.top()] = 0;
            s.pop();
        }
        s.pop();
    }
}
int main()
{
    int u, v;
    scanf("%d %d", &n, &m);
    memset(head, -1, sizeof(head));
    for(int i = 1 ; i <= m ; ++ i){
        scanf("%d %d", &u, &v);
        add(u, v); add(v, u);
    }
    for(int i = 1 ; i <= n ; ++ i){
        if(!dfn[i]){
            tarjan(i, i);
        }
    }
    int p[maxn] = {0};
    for(int i = 1 ; i <= n ; ++ i){
        for(int j = head[i] ; j != -1 ; j = edge[j].next){
            int tt = edge[j].to;
            if(col[tt] != col[i]){
                p[col[i]]++;
            }
        }
    }
    int ans = 0;
    //cout << num << endl;
    //for(int i = 1 ; i <= num ; ++ i) cout << p[i] << endl;
    for(int i = 1 ; i <= num ; ++ i){
        if(p[i] == 1) ans ++;
    }
    printf("%d\n", (ans + 1) / 2);
    return 0;
}