由于数据不存在环,所以一定能找到食物链的起点,那么就可以由食物链的起点记忆化搜索直到终点然后返回1,说明有一条食物链,然后就没了,具体看代码理解吧
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<deque>
#include<map>
#include<stdlib.h>
#include<set>
#include<iomanip>
#include<stack>
#define ll long long
#define ms(a,b) memset(a,b,sizeof(a))
#define lowbit(x) x & -x
#define fi first
#define ull unsigned long long
#define se second
#define endl "\n"
#define bug cout<<"----acac----"<<endl
#define IOS ios::sync_with_stdio(false), cin.tie(0),cout.tie(0)
using namespace std;
const int maxn =1e4+10;
const int maxm = 1.5e5+50;
const double eps = 1e-18;
const double inf = 0x3f3f3f3f;
const double lnf = 0x3f3f3f3f3f3f3f3f;
const int mod = 80112002;
const double pi=3.141592653589;
vector<int>ve[maxn];
int n,m;
ll in[maxn],dp[maxn];
ll ans=0;
ll dfs(int u)
{
if(ve[u].size()==0)
{
dp[u]=1;
return 1;
}
ll cnt=0;
for(int i=0;i<ve[u].size();i++)
{
int to=ve[u][i];
if(dp[to])cnt=(cnt+dp[to])%mod;
else cnt=(cnt+dfs(to))%mod;
}
return dp[u]=cnt;
}
int main()
{
ms(dp,0);
ms(in,0);
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int u,v;
scanf("%d%d",&u,&v);
ve[v].push_back(u);//一定要看清楚这是一条单向边
in[u]++;
}
for(int i=1;i<=n;i++)
{
if(!in[i])
{
for(int j=0;j<ve[i].size();j++)
{
ans=(ans+dfs(ve[i][j]))%mod;
}
}
}
printf("%lld\n",ans);
return 0;
}