CodeForces 284E Coin Troubles （DP+判环+背包）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
ll n,q,t,a[maxn],nxt[maxn];///换成int数据类型就不行了，，疯狂RE。。。不晓得为什么
ll dp[maxn],vis[maxn],cnt=0;
void dfs1(int x,int pre){
    if(x<=0) return ;
    cnt++;
    t-=pre*a[x];
    dfs1(nxt[x],pre+1);
}
int dfs2(int x){
    if(!x) return 0;
    int sum=a[x]+dfs2(nxt[x]);
    for(int i=t;i>=sum;i--) (dp[i-sum]+=dp[i])%=mod;
    return sum;
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n>>q>>t;
    rep(i,1,n+1) cin>>a[i];
    rep(i,0,q){
        int x,y;
        cin>>x>>y;
        nxt[y]=x;
        vis[x]=1;
    }
    rep(i,1,n+1) if(!vis[i])
        dfs1(i,0);
    if(t<0||cnt!=n){
        cout<<"0\n";
        return 0;
    }
    dp[t]=1;
    rep(i,1,n+1) if(!vis[i])
        dfs2(i);
    cout<<dp[0]<<"\n";
    return 0;
}