#include
#include
#include
#include
#include
#include
#include
using?namespace?std;
int?const?N=20001;
stacks;
vectormap[N]newmap[N];
bool?inStack[N];
int?dfsOrder[N]low[N]newOrder[N];
int?nodeSCC;
void?tarjan（int?x）
{
????dfsOrder[x]=low[x]=++node;
????s.push（x）;
????
????int?u;
????if（map[x].empty（）==false）
????for（int?i=0;i????{
????????u=map[x].at（i）;??????
????????if（inStack[u]）??????
????????if（dfsOrder[u]==0）
????????{
??????????tarjan（u）;
??????????low[x]=min（low[u]low[x]）;???????????
????????}
????????else?
????????{
??????????low[x]=min（low[x]dfsOrder[u]）;?????
????????}???
????}
?????
????if（dfsOrder[x]==low[x]）
??????{
??????????SCC++;
??????????while（s.top（）!=x）
??????????{
??????????????newOrder[s.top（）]=SCC;
??????????????inStack[s.top（）]=false;
??????????????s.pop（）;???????????????
??????????}
??????????newOrder[x]=SCC;
??????????inStack[x]=false;
??????????s.pop（）;??????????????????