Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MODU 1000000007
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589
 
 
#define izryt bool
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
    std::fill((T*) array, (T*) (array + N), val);
}
pii Dir[8] = { //??§????
    { 0 ,1 },{ -1 ,0 },{ 1 ,0 },{ 0 ,-1 },
    { 1 ,1 },{ 1 ,-1 },{ -1 ,1 },{ -1 ,-1 }
};
 
struct UnionFind {
    vector<int> data;
    UnionFind(int size) : data(size, -1) { }
    bool unionSet(int x, int y) { //????????\???£???????????????¨ y?????\???£?????????????????????
        x = root(x); y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    bool findSet(int x, int y) { //x???¨y????????????????????\???£??????????????????????????????
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    bool isroot(int x) {
        return data[x] < 0;
    }
    int size(int x) {
        return -data[root(x)];
    }
};
class Graph {
public:
    int vn;
    int sumcost = 0;
    vector<vector<pii>> g;
 
    Graph(int n) {
        vn = n;
        g.resize(n);
    }
    virtual void con(int a, int b, int w) = 0;
    int getWeight(int f, int t) {
        auto itr = lower_bound(ALL(g[f]), make_pair(t, INT_MIN));
        if (itr != g[f].end())
            return itr->second;
        return INT_MIN;
    }
    int Costsum() {
        return sumcost;
    }
};
 
class BiDGraph : public Graph {//??????
public:
    BiDGraph(int n) : Graph(n) {}
 
    void con(int a, int b, int w = 1) {
        g[a].push_back({ b,w });
        g[b].push_back({ a, w });
        sumcost++;
    }
};
 


void Lowlink(BiDGraph& g,vector<int>& lowlink, BiDGraph& dfsg, vector<int>& orb, int st = 0) {
	orb.resize(g.vn, INT_MAX);
	lowlink.resize(g.vn, INT_MAX);
	int k = 0;
	function<void(int,int)> dfs = [&](int cur, int f) {
		int nex = 0;
		orb[cur] = k++;
		lowlink[cur] = orb[cur];
		for (auto itr : g.g[cur]) {
			if (f == itr.first) continue;
			if (orb[itr.first] == INT_MAX) {
				dfs(itr.first,cur);
				lowlink[cur] = min(lowlink[cur], lowlink[itr.first]);
				dfsg.con(cur,itr.first);
			}
			else {
				lowlink[cur] = min(lowlink[cur], orb[itr.first]);
			}
		}
	};
	dfs(st,-1);
	return;
}

void Joint(BiDGraph& g, vector<int>& joints, int st = 0) {
	vector<int> lowlink, orb; 
	BiDGraph dfsg(g.vn);
	Lowlink(g, lowlink, dfsg, orb, st);

	REP(i,dfsg.vn) {
		if (st == i) continue;
		for (auto itr : dfsg.g[i]) {
			if (orb[i] > orb[itr.first]) continue;

			if (orb[i] <= lowlink[itr.first]) {
				joints.push_back(i);
				break;
			}
		}
	}
	if(dfsg.g[st].size() > 1)
		joints.push_back(st);
}
 
void Bridge(BiDGraph& g, vector<pii>& bridges) {
    vector<int> lowlink, orb; 
    BiDGraph dfsg(g.vn);
    Lowlink(g, lowlink, dfsg, orb);
 
    REP(i, g.vn) {
        for (auto itr : g.g[i]) {
            if (orb[i] > orb[itr.first]) continue;
 
            if (orb[i] < lowlink[itr.first]) {
                bridges.push_back({i, itr.first});
            }
        }
    }
}
void Joint(BiDGraph& g, vector<int>& joints) {
    vector<int> lowlink, orb; 
    BiDGraph dfsg(g.vn);
    Lowlink(g, lowlink, dfsg, orb);
 
    rep(i, 1, dfsg.vn) {
        for (auto itr : dfsg.g[i]) {
            if (orb[i] > orb[itr.first]) continue;
 
            if (orb[i] <= lowlink[itr.first]) {
                joints.push_back(i);
                break;
            }
        }
    }
    if(dfsg.g[0].size() > 1)
        joints.push_back(0);
}
 
signed main() {
    int v, e;
    scnaf("%d %d", &v, &e);
    BiDGraph g(v);
    REP(i, e) {
        int a, b;
        scanf("%d %d", &a, &b);
        g.con(a, b);
    }
    vector<int> joints;
    Joint(g, joints);
    sort(ALL(joints));
    for (auto itr : joints) {
        printf("%d\n", itr);
    }
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:200:10: error: call of overloaded 'Joint(BiDGraph&, std::vector<int>&)' is ambiguous
  200 |     Joint(g, joints);
      |     ~~~~~^~~~~~~~~~~
a.cc:136:6: note: candidate: 'void Joint(BiDGraph&, std::vector<int>&, int)'
  136 | void Joint(BiDGraph& g, vector<int>& joints, int st = 0) {
      |      ^~~~~
a.cc:171:6: note: candidate: 'void Joint(BiDGraph&, std::vector<int>&)'
  171 | void Joint(BiDGraph& g, vector<int>& joints) {
      |      ^~~~~