板子:
luogu3388割点
#include <cstdio>
#include <cstring>
#include <iostream>
#define N 100005
using namespace std;
struct hh{
int x,y;}bri[N];
int tot,point[N],nxt[N*2],v[N*2],nn,dfn[N],low[N],cnt,num;
bool vis[N],iscut[N];
void addline(int x,int y)
{
++tot; nxt[tot]=point[x]; point[x]=tot; v[tot]=y;
++tot; nxt[tot]=point[y]; point[y]=tot; v[tot]=x;
}
void tarjan(int now,int fa)
{
dfn[now]=low[now]=++nn;
int size=0;
for (int i=point[now];i;i=nxt[i])
if (!dfn[v[i]])
{
tarjan(v[i],no