Manthan, Codefest 17 C. Helga Hufflepuff's Cup

最新推荐文章于 2022-04-25 12:01:40 发布

twh233

最新推荐文章于 2022-04-25 12:01:40 发布

阅读量650

点赞数

分类专栏：树形dp

本文链接：https://blog.csdn.net/qq_36553623/article/details/78088016

版权

树形dp 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

传送门

input

output

input

output

input

output

题意：给你一棵树，可以染m种颜色，现在定义一种最高值k，一棵树上最多能有x个最高值，如果一个节点为最高值k，那么他相邻的节点的值只能选比他小的。现在问你一共有多少种染色的方法。

dp[i][j][k] 表示以i节点为根的字数上选j个最高值有多少种方法，k = 0表示选比K小的值，k = 1表示选值为k，k = 2表示选比k大的值

//china no.1
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e5+10;
const int maxx=2e5+100;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
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;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

vector<int>Q[maxn];
LL dp[maxn][12][3];

int n,m,K,X;
int sz[maxn];
LL t[12][3];

LL dfs(int x,int pre)
{
    dp[x][0][0]=K-1;
    dp[x][1][1]=1;
    dp[x][0][2]=m-K;
    sz[x]=1;
    for(int i=0;i<Q[x].size();i++)
    {
        int y=Q[x][i];
        if(y==pre) continue;
        dfs(y,x);
        me(t,0);
        FOR(0,sz[x],j)
        {
            FOR(0,sz[y],k)
            {
                if(j+k>X)
                    continue;
                t[j+k][0]=(t[j+k][0]+dp[x][j][0]*(dp[y][k][0]+dp[y][k][1]+dp[y][k][2])%mod)%mod;
                t[j+k][1]=(t[j+k][1]+dp[x][j][1]*(dp[y][k][0])%mod)%mod;
                t[j+k][2]=(t[j+k][2]+dp[x][j][2]*(dp[y][k][0]+dp[y][k][2])%mod)%mod;
            }
        }
        sz[x]=min(sz[x]+sz[y],X);
        FOR(0,sz[x],j)
        {
            FOr(0,3,k)
                dp[x][j][k]=t[j][k];
        }
    }
}
int main()
{
    W(s_2(n,m)!=EOF)
    {
        me(dp,0);
        me(sz,0);
        FOR(1,n,i)
        {
            Q[i].clear();
        }
        FOr(1,n,i)
        {
            int u,v;
            s_2(u,v);
            Q[u].push_back(v);
            Q[v].push_back(u);
        }
        s_2(K,X);
        dfs(1,-1);
        LL ans=0;
        FOR(0,X,j)
            FOr(0,3,k)
                ans=(ans+dp[1][j][k])%mod;
        print(ans);
    }
}