Manthan, Codefest 17 C. Helga Hufflepuff's Cup

树dp
三维状态
dp[i][j][k]表示 点i 的数字状态为j k为已经有的特殊颜色的个数

变成一个背包

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ans() printf("%d",ans)
#define ansn() printf("%d\n",ans)
#define anss() printf("%d ",ans)
#define lans() printf("%lld",ans)
#define lanss() printf("%lld ",ans)
#define lansn() printf("%lld\n",ans)
#define fansn() printf("%.10f\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define rsz(i,v) for(int i=0;i<(int)v.size();++i)
#define szz(x) ((int)x.size())
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pli pair<ll,int>
#define mp make_pair
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
#define sqr(a) ((a)*(a))
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1000000000+7;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
const ll infl = 10000000000000000;
const int maxn=  100000+10;
const int maxm = 100+10;
//Pretests passed
int in(int &ret)
{
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}
ll tmp[15][3];
ll dp[maxn][15][3];
int n,m;
vector<int>g[maxn];
int K,t;
void dfs(int u,int f)
{
    int sz  = g[u].size();
    dp[u][0][0] = K-1;
    dp[u][1][1] = 1;
    dp[u][0][2] = m-K;
    r0(i,sz)
    {
        int v = g[u][i];
        if(v==f)continue;
        dfs(v,u);
        mst(tmp,0);
        for(int j = 0;j<=t;++j)
        {
            for(int k = t;k>=j;--k)
            {
                tmp[k][0] += dp[u][k-j][0]*(dp[v][j][0]+dp[v][j][1]+dp[v][j][2]);
                tmp[k][0] %= mod;
                tmp[k][1] += dp[u][k-j][1]*(dp[v][j][0]);
                tmp[k][1] %= mod;
                tmp[k][2] += dp[u][k-j][2]*(dp[v][j][0]+dp[v][j][2]);
                tmp[k][2] %= mod;
            }
        }
        memcpy(dp[u],tmp,sizeof tmp);
    }
}
int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    in(n),in(m);
    r1(i,n-1)
    {
        int u,v;
        sdd(u,v);
        g[u].pb(v);
        g[v].pb(u);
    }
    in(K),in(t);
    dfs(1,0);
    ll ans = 0;
    r0(i,t+1)ans = (ans+dp[1][i][0]+dp[1][i][1]+dp[1][i][2]) %mod;
    lansn();
    return 0;
}