[树形DP] HihoCoder #1471 Challenge 27 拥堵的城市

大概就是$f[i][j]$表示$i$子树中还有$j$条链伸出来
子树合并进来转移一下 转移的时候枚举 k <script type="math/tex" id="MathJax-Element-232">k</script>对边要配对 也就是不伸出去了
比赛的时候复杂度分析错 搞得自己一开始否定了这个转移
最后几十秒钟查出错还把代码给交错了
真的是整场比赛智商无下限
感谢整场带我的rxd大爷

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<iostream>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;

inline char nc(){
    return getchar();
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=305;
const int P=1e9+7;

int Pow(int a,int b){
    int res=1;
    for (;b;b>>=1,a=1ll*a*a%P) if (b&1) res=1ll*res*a%P;
    return res;
}

const int INV2=(P+1)/2;
ll fac[N<<1],inv[N<<1];
inline void Pre(int n){
    /*
  fac[0]=1; for (int i=1;i<=n;i++) fac[i]=fac[i-1]*i%P;
  inv[1]=1; for (int i=2;i<=n;i++) inv[i]=inv[P%i]*(P-P/i)%P;
  inv[0]=1; for (int i=1;i<=n;i++) (inv[i]*=inv[i-1])%=P;
  */
  fac[0]=1;
  for (int i=1;i<=n;i++) fac[i]=fac[i-1]*i%P;
  for (int i=0;i<=n;i++) inv[i]=Pow(fac[i],P-2)%P;
}
inline ll C(int n,int m){
  return fac[n]*inv[m]%P*inv[n-m]%P;
}

struct edge{
  int u,v,next;
}G[N<<1];
int head[N],inum;
inline void add(int u,int v,int p){
  G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}

int n,K;
ll f[N][N];
ll tmp[N<<1],t2[N<<1];
int sz[N];
#define V G[p].v
inline void dfs(int u,int fa){
  for (int p=head[u];p;p=G[p].next)
    if (V!=fa)
      dfs(V,u);
  int flag=0;
  memset(tmp,0,sizeof(tmp));
  tmp[0]=tmp[1]=1;
  sz[u]=1;
  for (int p=head[u];p;p=G[p].next)
    if (V!=fa){
      cl(t2);
      for (int i=0;i<=sz[u];i++)
    if (tmp[i])
      for (int j=0;j<=sz[V];j++)
        if (f[V][j])
          for (int k=0;k<=min(i,j);k++)
        (t2[i+j-2*k]+=tmp[i]*f[V][j]%P*C(i,k)%P*C(j,k)%P*fac[k]%P)%=P;
      cl(tmp);
      for (int i=0;i<=sz[u]+sz[V];i++) tmp[i]=t2[i];
      sz[u]+=sz[V];
    }
  for (int i=0;i<=K;i++)
    f[u][i]=tmp[i];
}

int main(){
  freopen("t.in","r",stdin);
  freopen("t1.out","w",stdout);
  int iu,iv;
  read(n); read(K); Pre(2*n);
  for (int i=1;i<n;i++)
    read(iu),read(iv),add(iu,iv,++inum),add(iv,iu,++inum);
  dfs(1,0);
  cout<<f[1][0]<<endl;
  return 0;
}