题目链接:
https://www.luogu.org/problem/P2812
思路:
1:该题目和https://blog.csdn.net/aiwo1376301646/article/details/98482052完全一致
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e4+1;
vector<int>e[maxn];
set<int>ee[maxn];
int dfn[maxn],low[maxn],ins[maxn],color[maxn],timing,cnt,n,id[maxn];
stack<int>s;
void tarjan(int x)
{
low[x]=dfn[x]=++timing;
s.push(x);
ins[x]=1;
for(int i=0;i<e[x].size();i++)
{
int v=e[x][i];
if(!dfn[v])
{
tarjan(v);
low[x]=min(low[x],low[v]);
}
else if(ins[v])
{
low[x]=min(low[x],dfn[v]);
}
}
if(dfn[x]==low[x])