HDU 6540 Neko and tree(树形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 root l,r,rt
#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=5e3+100;
const int ub=1e6;
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);
}
vector<int> g[maxn];
ll sum[maxn][maxn],dp[maxn][maxn],ans=0,tmp[maxn];
int n,m,k,vis[maxn];
void dfs(int u,int f){
    rep(i,0,g[u].size()){
        int v=g[u][i];
        if(v==f) continue;
        dfs(v,u);
        rep(j,1,k+1){
            tmp[j]=dp[u][j]*sum[v][min(j,k-j)-1]%mod;
            tmp[j]=(tmp[j]+dp[v][j-1]*sum[u][min(j,k-j)]%mod)%mod;
        }
        rep(j,1,k/2+1){
            tmp[j]=(tmp[j]+mod-dp[u][j]*dp[v][j-1]%mod)%mod;
        }
        rep(j,1,k+1){
            dp[u][j]+=(dp[v][j-1]+tmp[j])%mod;
            dp[u][j]%=mod;
            sum[u][j]=(sum[u][j-1]+dp[u][j])%mod;
        }
    }
    if(vis[u]){
        dp[u][0]=sum[u][0]=1;
        rep(i,1,k+1){
            dp[u][i]=dp[u][i]*2%mod;
            sum[u][i]=(sum[u][i-1]+dp[u][i])%mod;
        }
    }
    if(u==1) ans=(ans+sum[u][k])%mod;
    else ans=(ans+dp[u][k])%mod;
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);*/
    cin>>n>>m>>k;
    rep(i,1,n){
        int x,y;
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    rep(i,0,m){
        int x;cin>>x;
        vis[x]=1;
    }
    dfs(1,0);
    cout<<ans<<"\n";
    return 0;
}