拓扑排序二刷 填充ing

鉴于自己学了拓扑排序 除了刷Kuangbin专题的时候用拓扑排序 其他时候都没用到拓扑排序
(需要用的时候也没用到
所以需要二刷拓扑排序
P4017
题意 给你n个点 m 个有向边 代表捕食关系
问你食物链个数和
我们把所有入度为0的点的sum初始化为1
然后当这个点没有出度的时候 统计答案
否则把当前方案数传递给这个点的出度

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)
#define MOD 80112002

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 5025;
int p[MAX_N],eid,indegre[MAX_N],ans = 0,sum[MAX_N];
queue<int>q;
void init()
{
    memset(p,-1,sizeof(p));
    eid = 0;
}
struct edge
{
    int v,next;
}e[500025];
void add(int u,int v)
{
    e[eid].v = v;
    e[eid].next = p[u];
    p[u] = eid++;
}
void top_sort()
{
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        if(p[u]==-1) ans = (ans+sum[u])%MOD;
        for(int i = p[u];i+1;i=e[i].next)
        {
            int v = e[i].v;
            indegre[v]--;
            sum[v] = (sum[v]+sum[u])%MOD;
            if(!indegre[v]) q.push(v);
        }
    }
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,a,b;
    scanf("%d%d",&n,&m);
    init();
    for(int i = 1;i<=m;++i)
    {
        scanf("%d%d",&a,&b);
        add(a,b);
        indegre[b]++;
    }
    for(int i = 1;i<=n;++i)
    {
        if(!indegre[i]) sum[i] = 1,q.push(i);
    }
    top_sort();
    printf("%d\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}