tarjan模板

int head[maxn], dfn[maxn], low[maxn];
int st[maxn], ins[maxn], c[maxn];
vector<int>ssc[maxn];
int n, m, tot, num, top, cnt;
struct node{
	int v, to;
}cc[eg];
void add(int u, int v) {
	tot++;
	cc[tot].to = head[u];
	cc[tot].v = v;
	head[u] = tot;
}
void tarjan(int x) {
	dfn[x] = low[x] = ++num;
	st[++top] = x, ins[x] = 1;
	for(int i = head[x]; i; i = cc[i].to) {
		int v = cc[i].v;
		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]) {
		cnt++;int y;
		do{
			y = st[top--], ins[y] = 0;
			c[y] = cnt, ssc[cnt].push_back(y);
		}while(x != y);
	}
}
struct NP{
	int to, v;
}P[eg];
int np_head[maxn], np_tot;
void add_c(int x, int y) {
	np_tot++;
	P[np_tot].to = np_head[x];
	P[np_tot].v = y;
	np_head[x] = np_tot;
}

//main
void init() {
	num = np_tot = cnt = tot = top = 0;
	for(int i = 1; i <= n; i++) {
		ins[i] = dfn[i] = head[i] = np_head[i] = 0;
		ssc[i].clear();
	}
}
for(int i = 1; i <= n; i++) {
		if(!dfn[i]) tarjan(i);
	}
	for(int i = 1; i <= n; i++) {
		for(int j = head[i]; j; j = cc[j].to) {
			int v = cc[j].v;
			if(c[i] == c[v]) continue;
			add_c(c[i], c[v]);
		}
	}