容斥原理
把三个容斥套一起
我们枚举至少有 i i i行没有染色,至少 j j j列没有染色,至少 k k k种颜色没有用到,那么剩下 ( n − i ) ( m − j ) (n-i)(m-j) (n−i)(m−j)个格子每个都有 c + 1 − k c+1-k c+1−k种选择(可以在剩下 c − k c-k c−k种颜色中挑一种,也可以不染色),因此答案就是
∑ i = 0 n ∑ j = 0 m ∑ k = 0 c ( − 1 ) i + j + k C n i C m j C c k ( c + 1 − k ) ( n − i ) ( m − j ) \sum\limits_{i=0}^n\sum\limits_{j=0}^m\sum\limits_{k=0}^c(-1)^{i+j+k}C_n^iC_m^jC_c^k(c+1-k)^{(n-i)(m-j)} i=0∑nj=0∑mk=0∑c(−1)i+j+kCniCmjCck(c+1−k)(n−i)(m−j)
先枚举 k k k, O ( n m ) O(nm) O(nm)预处理 ( c + 1 − k ) (c+1-k) (c+1−k)的幂,再枚举 i i i和 j j j计算答案,总复杂度 O ( n m c ) O(nmc) O(nmc)。组合数一开始用杨辉三角预处理即可,因为数据范围很小。
#include <cctype>
#include <cstdio>
#include <climits>
#include <algorithm>
template <typename T> inline void read(T& x) {
int f = 0, c = getchar(); x = 0;
while (!isdigit(c)) f |= c == '-', c = getchar();
while (isdigit(c)) x = x * 10 + c - 48, c = getchar();
if (f) x = -x;
}
template <typename T, typename... Args>
inline void read(T& x, Args&... args) {
read(x); read(args...);
}
template <typename T> void write(T x) {
if (x < 0) x = -x, putchar('-');
if (x > 9) write(x / 10);
putchar(x % 10 + 48);
}
template <typename T> inline void writeln(T x) { write(x); puts(""); }
template <typename T> inline bool chkmin(T& x, const T& y) { return y < x ? (x = y, true) : false; }
template <typename T> inline bool chkmax(T& x, const T& y) { return x < y ? (x = y, true) : false; }
typedef long long LL;
const int maxn = 402;
const LL mod = 1e9 + 7;
LL C[maxn][maxn];
LL p[maxn * maxn];
int n, m, c, mx;
inline void init_pow(int x) {
p[0] = 1;
for (int i = 1, _end = m * n; i <= _end; ++i)
p[i] = p[i - 1] * x % mod;
}
inline void init_C() {
mx = std::max(std::max(n, m), c);
for (int i = 0; i <= mx; ++i)
C[i][0] = 1;
for (int i = 1; i <= mx; ++i)
for (int j = 1; j <= i; ++j)
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
}
int main() {
read(n, m, c);
init_C();
LL ans = 0;
for (int k = 0; k <= c; ++k) {
init_pow(c + 1 - k);
for (int i = 0; i <= n; ++i)
for (int j = 0; j <= m; ++j) {
LL sgn = (i + j + k) & 1 ? -1 : 1;
LL res = C[n][i] * C[m][j] % mod * C[c][k] % mod * p[(n - i) * (m - j)] % mod;
ans = ((ans + sgn * res) % mod + mod) % mod;
}
}
writeln(ans);
return 0;
}