注意到条件「不同颜色的棋子不能放在同一行」,可以得出,一种颜色的棋子放完之后,这些棋子会占领一定的行和列,这些行和列不能继续放棋子。
所以定义状态
f[k][i][j]
f
[
k
]
[
i
]
[
j
]
表示到第
k
k
种颜色,还剩下行
j
j
列没被占领。
边界为。
转移为:
f[k][i][j]=∑i<h≤n∑j<l≤mf[k−1][h][l]×Cih×Cjl×g[k][h−i][l−j]
f
[
k
]
[
i
]
[
j
]
=
∑
i
<
h
≤
n
∑
j
<
l
≤
m
f
[
k
−
1
]
[
h
]
[
l
]
×
C
h
i
×
C
l
j
×
g
[
k
]
[
h
−
i
]
[
l
−
j
]
g[k][i][j] g [ k ] [ i ] [ j ] 表示第 k k 种颜色恰好占领行 j j 列的方案数。
关于,
先不考虑「恰好」,则为 Ccntki×j C i × j c n t k ( cntk c n t k 为第 k k 种颜色的棋子个数)
然后除去不合法的方案数,即
最后结果就是 ∑ni=0∑mj=0f[c][i][j] ∑ i = 0 n ∑ j = 0 m f [ c ] [ i ] [ j ] (不一定要占领所有的格子)。
代码:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
inline int read() {
int res = 0; bool bo = 0; char c;
while (((c = getchar()) < '0' || c > '9') && c != '-');
if (c == '-') bo = 1; else res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - 48);
return bo ? ~res + 1 : res;
}
const int R = 2005, N = 33, E = 13, MX = 1e9 + 9;
int n, m, c, orz, h, cnt[E], C[R][R], g[E][N][N], f[E][N][N];
int main() {
int i, j, k, h, l; n = read(); m = read(); c = read();
for (i = 1; i <= c; i++) orz += (cnt[i] = read());
for (i = 0; i <= 2000; i++) C[i][0] = 1;
for (i = 1; i <= 2000; i++) for (j = 1; j <= i; j++)
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MX;
for (k = 1; k <= c; k++) for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) {
g[k][i][j] = C[i * j][cnt[k]];
for (h = 1; h <= i; h++) for (l = 1; l <= j; l++) if (h != i || l != j)
g[k][i][j] = (g[k][i][j] - 1ll * g[k][h][l]
* C[i][h] % MX * C[j][l] % MX + MX) % MX;
}
f[0][n][m] = 1; for (k = 1; k <= c; k++) for (i = 0; i <= n; i++)
for (j = 0; j <= m; j++) for (h = i + 1; h <= n; h++)
for (l = j + 1; l <= m; l++)
f[k][i][j] = (f[k][i][j] + 1ll * f[k - 1][h][l]
* g[k][h - i][l - j] % MX * C[h][i] % MX * C[l][j] % MX) % MX;
int ans = 0; for (i = 0; i <= n; i++) for (j = 0; j <= m; j++)
ans = (ans + f[c][i][j]) % MX; cout << ans << endl;
return 0;
}