蓝魔法师 （树形dp）

link

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
template<typename _T>
void read(_T &x){
	_T f=1;x=0;char s=getchar();
	while(s>'9'||s<'0'){if(s=='-')f=-1;s=getchar();}
	while('0'<=s&&s<='9'){x=(x<<3)+(x<<1)+(s^48);s=getchar();}
	x*=f;
}
template<typename _T>
void print(_T x){if(x<0)putchar('-'),print(-x);if(x>9)print(x/10);putchar(x%10+'0');}
const int maxn=1e5+10;
const int mod=998244353;
int qmi(int a,int b)
{int res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
const int N=2100;
int dr[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
vector<int>g[N];
int dp[N][N];
int siz[N];
void dfs(int u,int fa)
{
    siz[u]=1;
    dp[u][1]=1;
    for(auto v:g[u])
    {
        if(v==fa)continue;
        dfs(v,u);
        int sum=0;
        for(int i=1;i<=min(siz[v],k);i++) sum=(sum+ dp[v][i])%mod;
        for(int i=min(siz[u],k);i>=1;i--){
        for(int j=min(siz[v],k);j>=1;j--)  
        if(i+j<=k)dp[u][i+j]=(dp[u][i+j]+dp[u][i]*dp[v][j]%mod+mod)%mod;        
        dp[u][i]=dp[u][i]*sum%mod;
      }
        siz[u]+=siz[v];
    }
}
void solve()
{
	cin>>n>>k;
    fer(i,1,n-1)
    {
        int a,b;
        cin>>a>>b;
        g[a].pb(b);
        g[b].pb(a);
    }
    dfs(1,0);
    int ans=0;
    //fer(i,1,n)cout<<siz[i]<<" ";
    //fer(i,1,k)cout<<dp[1][k]<<endl;
    fer(i,1,k)ans=(ans+dp[1][i])%mod;
    cout<<ans<<endl;
    
}
signed main()
{
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}