模板 const int N10005;
struct Edge {int v,next;
}edge[5*N];
int dfn[N],low[N];
int stack[N],node[N],visit[N],cnt,tot,index;
int belong[N],bcnt;
void add_edge(int x,int y)
{edge[cnt].nextnode[x];edge[cnt].v y;node[x]cnt;return ;}void tarjan(int x)//代表第几…