Sol-Dp-生日聚会

Solution of ZJOI2008-生日聚会

dp,设$dp[i][j][k][t]$表示前i个人中有j个是男生,以i为结尾的任意一段男生比女生最多多x人，女生比男生最多多y人的方案数

每次转移枚举多的人数 , 用的是刷表法

demo:

// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
#include<algorithm>
#define wys 12345678
using namespace std ;
#define loop(I,X,Y) for (int I = (X) , end = (Y) ; I <= end ; ++ I)
#define wh                                            f[i][j][k][t]
#define int                                               long long 
int n , m , d , ans ;
int f[310][155][25][25] ;
long long max(long long a , long long b){
    if(a<b)return b ;
    return a ;
}
signed main(){
    scanf("%lld%lld%lld",&n,&m,&d) ;
    f[0][0][0][0]=1;
    loop(i,0,n+m-1){
        loop(j,0,n){
            loop(k,0,d){
                loop(t,0,d){
                    	if(j+1<=n&&k+1<=d) (f[i+1][j+1][k+1][max((t-1),0)]+=wh)%=wys ;
                        if(i+1-j<=m&&t+1<=d) (f[i+1][j][max((k-1),0)][t+1]+=wh)%=wys ;
                }
            }
        }
    }
    loop(i,0,d)
        loop(j,0,d)
            (ans+=f[n+m][n][i][j])%=wys;
    printf("%lld\n",ans);
    return 0;
}