【LOJ P2597】灾难 动态维护LCA + 拓扑排序

传送门

分析

我们可以建两张图，我们对反图做拓扑排序，可以发现，一个点前面的物种全部灭亡，这个物种也必定灭亡，所以我们可以根据这个来建树
一个物种灭亡的条件是当他的食物全部灭亡的时候，所以我们可以求出来他所有食物的$LCA$，然后把当前点连在$LCA$上即可，需要在拓扑排序的过程中动态维护一下

代码

#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
	char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
	while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
VI a[N], b[N], c[N];
int sum[N];
int f[N][30];
int d[N];
int din[N];
int n;

int LCA(int a, int b) {
	if (d[a] < d[b]) swap(a, b);
	for (int i = 29; i >= 0; i--)
		if (d[f[a][i]] >= d[b])
			a = f[a][i];
	if (a == b) return a;
	for (int i = 29; i >= 0; i--)
		if (f[a][i] != f[b][i])
			a = f[a][i], b = f[b][i];
	return f[a][0];
}

void topsort() {
	queue<int> q;
	for (int i = 1; i <= n; i++) if (!din[i]) a[0].pb(i), b[i].pb(0), din[i]++;
	q.push(0);
	while (q.size()) {
		int t = q.front();
		q.pop();
		int lca;
		if (t == 0) lca = 0;
		else lca = b[t][0];
		for (int i = 1; i < b[t].size(); i++) {
			if (!lca) break;
			lca = LCA(lca, b[t][i]);
		}
		d[t] = d[lca] + 1;
		f[t][0] = lca;
		if (t)c[lca].pb(t);
		for (int i = 1; i <= 29; i++)
			if (f[t][i - 1]) f[t][i] = f[f[t][i  - 1]][i - 1];
		for (int j : a[t]) {
			din[j]--;
			if (!din[j]) q.push(j);
		}
	}
}

void dfs(int u) {
	sum[u] = 1;
	for (int j : c[u]) {
		dfs(j);
		sum[u] += sum[j];
	}
}


int main() {
	read(n);
	for (int i = 1; i <= n; i++) {
		int x;
		while (scanf("%d", &x) && x != 0) {
			a[x].pb(i);
			b[i].pb(x);
			din[i]++;
		}
	}
	topsort();
	dfs(0);
	for (int i = 1; i <= n; i++) printf("%d\n", sum[i] - 1);
	return 0;
}