做法: 开一个数组num用来记录和传递病毒数量
AC代码:
#include<bits/stdc++.h>
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb(x) push_back(x)
#define sz(x) (int)(x).size()
#define sc(x) scanf("%d",&x)
#define abs(x) ((x)<0 ? -(x) : x)
#define all(x) x.begin(),x.end()
#define mk(x,y) make_pair(x,y)
#define fin freopen("in.txt","r",stdin)
#define fout freopen("out.txt","w",stdout)
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int mod = 142857;
const double PI = 4*atan(1.0);
const int maxm = 5e6+5;
const int maxn = 1e5+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 1ll<<62;
vector<int> vec[maxn];
int n,m,k;
int num[maxn],d[maxn];
void topsort()
{
queue<int> q;
for(int i=1;i<=n;i++) if(d[i] == 0) q.push(i);
while(!q.empty())
{
int x = q.front();
q.pop();
for(int i=0;i<sz(vec[x]);i++)
{
d[vec[x][i]]--;
num[vec[x][i]]=(num[vec[x][i]]+num[x])%mod;
if(d[vec[x][i]] == 0) q.push(vec[x][i]);
}
}
ll ans = 0;
for(int i=1;i<=n;i++) ans = (ans+num[i])%mod;
cout<<ans<<endl;
}
int main()
{
// fin;
IO;
cin>>n>>m>>k;
for(int i=1;i<=k;i++)
{
int e;
cin>>e;
num[e] = 1;
}
for(int i=1;i<=m;i++)
{
int u,v;
cin>>u>>v;
vec[u].pb(v);
d[v]++;
}
topsort();
return 0;
}