codeforces 466E Information Graph 并查集LCA离线一通乱搞

想明白一点就很简单了，询问一个人是否签过一份文件是可以分离出来的，只要一个文件已经被签署了，那么不管什么时候询问，答案都是确定的，所以把3类询问分离出来，每次签完一份文件就处理这份文件相关询问即可

//也可能只有我被这种地方卡了?

#pragma warning(disable:4996)
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long LL;
const int maxn = 100005;
int n, m;
int f[maxn];
int pos[maxn];
int anc[maxn][20],far[maxn];
bool ret[maxn];
vector<int> G[maxn];

int root(int x) {
	if (!f[x]) return x;
	return f[x] = root(f[x]);
}
void merge(int x,int y) {
	x = root(x);
	y = root(y);
	if(x!=y) f[x] = y;
}
void dfs(int x) {
	for (int i = 0;i < G[x].size();i++) {
		int son = G[x][i];
		anc[son][0] = x;
		far[son] = far[x] + 1;	
		dfs(son);
	}
}
void getAnc() {
	for (int i = 1;i < 20;i++)
		for (int j = 1;j <= n;j++) {
			anc[j][i] = anc[anc[j][i - 1]][i - 1];
		}
}
bool LCA(int x, int y) {
	if (root(x)!=root(y)|| far[x] > far[y]) return 0;
	int k = far[y] - far[x];
	for (int i = 19;i >= 0;i--) if (k >= (1 << i)) {
		k -= (1 << i);
		y = anc[y][i];
	}
	return x == y;
}
typedef struct Change {
	int tp,x,y;
}Change;
typedef struct Query {
	int x, y,id;
	friend bool operator < (Query a, Query b) {
		return a.y < b.y;
	}
}Query;
Change C[maxn];
Query Q[maxn];
bool v1[maxn];
int c = 0,c1=0,c2=0;
int main() {
	cin >> n >> m;
	for (int i = 0;i < m;i++) {
		int md;
		scanf("%d", &md);
		if (md == 1) {
			C[c1].tp = 1;
			scanf("%d%d", &C[c1].x, &C[c1].y);
			G[C[c1].y].push_back(C[c1].x);
			v1[C[c1].x] = 1;
			c1++;
		}
		else if (md == 2) {
			C[c1].tp = 2;
			scanf("%d", &C[c1].x);
			C[c1].y = ++c;
			c1++;
		}
		else {
			scanf("%d%d", &Q[c2].x, &Q[c2].y);
			Q[c2].id = c2;
			c2++;
		}
	}
	sort(Q, Q + c2);
	for (int i = 1;i <= n;i++) if (!v1[i]) {
		far[i] = 0;
		dfs(i);
	}
	getAnc();
	for (int i = 0,j=0;i < c1&&j<c2;i++) {
		if (C[i].tp == 1) merge(C[i].x, C[i].y);
		else {
			pos[C[i].y] = C[i].x;
			for (;j < c2&&Q[j].y == C[i].y;j++) ret[Q[j].id] = LCA(Q[j].x, pos[Q[j].y]);
		}
	}
	for (int i = 0;i < c2;i++) {
		if (ret[i]) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}