P4017 最大食物链计数(拓扑排序)

P4017 最大食物链计数https://www.luogu.com.cn/problem/P4017

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int head[MAXN];
int nxt[MAXN];
int in[MAXN];
int out[MAXN];
int ver[MAXN];
int cnt;
inline void add(int x, int y) {
	ver[++cnt] = y;
	in[y]++;
	nxt[cnt] = head[x];
	head[x] = cnt;
}

int n, m;
ll ans;
const int mod = 80112002;
int d[MAXN];

inline void topsort() {
	queue<int> que;
	for (int i = 1; i <= n; i++) {
		if (in[i] == 0) {
			que.push(i);
			d[i] = 1;
		}
	}
	while (!que.empty()) {
		int x = que.front();
		que.pop();
		for (int i = head[x]; i; i = nxt[i]) {
			int y = ver[i];
			d[y]=(d[x]+d[y])%mod;
			if (--in[y] == 0) {
				que.push(y);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		if (!out[i]) {
			ans = (ans + d[i]) % mod;
		}
	}
	printf("%lld", ans);
}

int main() {
	scanf("%d %d", &n, &m);
	int x, y;
	for (int i = 1; i <= m; i++) {
		scanf("%d %d", &x, &y);
		out[x]++;
		add(x, y);
	}
	topsort();
	return 0;
}