1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<queue>
#include<map>
#include<stack>
#include<algorithm>
#include<list>
using namespace std;
typedef vector<vector<int> > adj;
struct node
{
    node():visit(0){}
    int p;
    int low;
    int dfn;
    bool visit;
    int root;
};
class tarjan
{
public:
    tarjan(){}
    tarjan(adj* padj,node* pnode,int size);
    void set(adj* padj,node* pnode,int size);
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX