int tol,head[maxn];
struct edge
{
int to,next;
}es[maxm];
void addedge( int u , int v )
{
es[tol].to = v;
es[tol].next = head[u];
head[u] = tol++;
}
int Low[maxn],Dfn[maxn],Stack[maxn],Belong[maxn];
int Index,Top,Block,cc,tmp[maxn];
bool Instack[maxn];
void dfs( int u , int f )
{
int v;
Low[u] = Dfn[u] = ++Index;
Stack[Top++] = u;
Instack[u] = true;
for ( int i=head[u] ; i!=-1 ; i=es[i].next )
{
v = es[i].to;
if ( v==f ) continue;
if ( !Dfn[v] )
{
dfs( v , u );
if ( Low[u]> Low[v] ) Low[u] = Low[v];
if ( Low[v]>=Dfn[u] )
{
Block++;
int vn;
cc = 0;
do
{
vn = Stack[--Top];
Belong[vn] = Block;
Instack[vn] = false;
tmp[cc++] = vn;
}while ( vn!=v );
tmp[cc++] = u;
}
}
else if ( Instack[v]&&Low[u]>Dfn[v] )
Low[u] = Dfn[v];
}
}
void Tarjan()
{
memset ( Dfn , 0 , sizeof(Dfn) );
memset ( Instack , false , sizeof(Instack) );
Index = Block = Top = 0;
for ( int i=1 ; i<=n ; i++ )
if ( !Dfn[i] ) dfs( i , i );
}