【CLYZ集训】全面沦陷【Tarjan】【差分】

思路：

首先缩点，转化为DAG
先把每个点的拓扑序跑出来，考虑一个点u，根据拓扑序的定义，它只能被拓扑序小于它的点到达，它也只能到达拓扑序大于它的点。也就是说，设拓扑序大于它的第一个u能到达的点为v，则u——v之间的点都是到达不了的。反过来，设拓扑序小于它的最后一个能到达u的点为v，则v——u之间的点都不能到达u。
于是用nxt和pre数组记录上文所说的点v,然后用差分弄出哪些点可以所有点都满足。

$code$

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

const int MAXN = 1e6 + 10;

int n, m;
vector<int> e[MAXN], b[MAXN], g[MAXN];
int dfn[MAXN], low[MAXN], c[MAXN], stack[MAXN], cnt, top, tmp;
int d[MAXN], nxt[MAXN], pre[MAXN], f[MAXN];
int A[MAXN], ans[MAXN], ANS;
queue<int> q;
bool v[MAXN];

void tarjan(int x) {
	dfn[x] = low[x] = ++ cnt;
	v[x] = 1;
	stack[++ top] = x;
	for(int i = 0; i < e[x].size(); i ++) {
		int y = e[x][i];
		if(!dfn[y]) tarjan(y), low[x] = min(low[x], low[y]);
		else if(v[y]) low[x] = min(low[x], dfn[y]);
	}
	if(dfn[x] == low[x]) {
		tmp ++;
		do {
			c[stack[top]] = tmp;
			g[tmp].push_back(stack[top]);
			v[stack[top]] = 0;
			top --;
		}
		while(x != stack[top + 1]);
	}
	return;
}

void topu() {
	for(int i = 1; i <= tmp; i ++) {
		if(!d[i]) {
			q.push(i);
			f[i] = ++ cnt;
			for(int j = 0; j < g[i].size(); j ++) c[g[i][j]] = f[i];
		}
	}
	while(!q.empty()) {
		int x = q.front();
		q.pop();
		for(int i = 0; i < b[x].size(); i ++) {
			int y = b[x][i];
			d[y] --;
			if(!d[y]) {
				f[y] = ++ cnt;
				q.push(y);
				for(int j = 0; j < g[y].size(); j ++) c[g[y][j]] = f[y];
			}
		}
	}
}

int main() {
	freopen("defeat.in", "r", stdin);
	freopen("defeat.out", "w", stdout);
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; i ++) {
		int x, y;
		scanf("%d%d", &x, &y);
		e[x].push_back(y);
	}
	for(int i = 1; i <= n; i ++) if(!dfn[i]) tarjan(i);
	for(int i = 1; i <= n; i ++) {
		for(int j = 0; j < e[i].size(); j ++) {
			int y = e[i][j];
			if(c[y] == c[i]) continue;
			b[c[i]].push_back(c[y]);
			d[c[y]] ++;
		}
	}
	cnt = 0;
	topu();
	for(int i = 1; i <= tmp; i ++) {
		nxt[i] = tmp + 1;
		for(int j = 0; j < b[i].size(); j ++) {
			nxt[i] = min(nxt[i], f[b[i][j]]);
			pre[b[i][j]] = max(pre[b[i][j]], f[i]);
		}
	}
//	for(int i = 1; i <= tmp; i ++) cout<<pre[i]<<" "<<f[i]<<' '<<nxt[i]<<endl;
	for(int i = 1; i <= tmp; i ++) A[f[i] + 1] ++, A[nxt[i]] --, A[pre[i] + 1] ++, A[f[i]] --;
	for(int i = 1; i <= tmp; i ++) A[i] += A[i - 1];
	for(int i = 1; i <= n; i ++) {
		if(A[c[i]] == 0) ans[++ ANS] = i;
	} 
	printf("%d\n", ANS);
	for(int i = 1; i <= ANS; i ++) printf("%d ", ans[i]);
	return 0;
}