BZOJ3294: [Cqoi2011]放棋子

思路：明确一个事实就是一种颜色其实最终的状态是占了几行几列。

坑点：最开始把maxn弄混了，然后数组开的特别大，bzojT掉了。话说数组开大为什么会T啊。。

#include <bits/stdc++.h>
using namespace std;
typedef int lint;
typedef long long LL;
const int maxn = 2005;
const int mod =  1000000009;
lint C[maxn][maxn];
lint ad( LL x,LL y ){
    x += y;
    if( x > mod ) x-= mod;
    return x;
}
lint mul( LL x,LL y ){
    x *= y;
    x %= mod;
    return x;
}
void init( lint n ){
    for( lint i = 0;i <= n;i++ )C[i][0] = 1;
    for( lint i = 1;i <= n;i++ ){
        for( lint j = 1;j <= i;j++ ){
            C[i][j] = ad(C[i-1][j-1] , C[i-1][j]);
        }
    }
}
lint sub( LL x,LL y ){
    x-=y;
    if(x<0) x += mod;
    return x;
}
const int maxc = 20;
lint v[maxc],g[maxc][31][31],f[maxc][31][31];
int main(){
    lint n,m,cc;
    scanf("%d%d%d",&n,&m,&cc);
    init( n*m+10 );
    for( lint i = 1;i <= cc;i++ )scanf("%d",&v[i]);
    g[0][0][0] = f[0][0][0] = 1;
    for( lint c = 1;c <= cc;c++ ){
        for( lint  i = 1;i <= n;i++ ){
            for( lint j = 1;j <=m;j++ ){
                g[c][i][j] = C[i*j][v[c]];
                if( !g[c][i][j] ) continue;
                for( lint mm = 1;mm <= i;mm++ ){
                    for( lint nn = 1;nn <= j;nn++ ){
                        if( mm == i && nn == j )continue;
                        g[c][i][j] = sub( g[c][i][j],mul( g[c][mm][nn],(LL)C[i][mm]*C[j][nn]%mod ) );
                    }
                }
            }
        }
    }
    LL ans = 0;
    for( lint c = 1;c <= cc;c++ ){
        for( lint i = 1;i <= n;i++ ){
            for( lint j = 1;j <= m;j++ ){
                for( lint mm =0;mm <= i;mm++ ){
                    for( lint nn = 0;nn <= j;nn++ ){
                        if( !f[c-1][mm][nn] || !g[c][i-mm][j-nn] )continue;
                        f[c][i][j] = ad( f[c][i][j],mul(f[c-1][mm][nn],(LL)g[c][i-mm][j-nn]*C[i][mm]%mod*C[j][nn]%mod) );
                    }
                }
                if( c == cc )ans = ad( ans,(LL)C[n][i]*C[m][j]%mod*f[c][i][j]%mod );
            }
        }
    }
    cout << ans;
    return 0;
}