CF111D：Petya and Coloring（组合数）

最新推荐文章于 2020-03-02 21:37:36 发布

junior19

最新推荐文章于 2020-03-02 21:37:36 发布

阅读量343

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/junior19/article/details/77373176

版权

数论专栏收录该内容

96 篇文章 0 订阅

订阅专栏

Little Petya loves counting. He wants to count the number of ways to paint a rectangular checkered board of size n × m (n rows, mcolumns) in k colors. Besides, the coloring should have the following property: for any vertical line that passes along the grid lines and divides the board in two non-empty parts the number of distinct colors in both these parts should be the same. Help Petya to count these colorings.

Input

The first line contains space-separated integers n, m and k (1 ≤ n, m ≤ 1000, 1 ≤ k ≤ 106) — the board's vertical and horizontal sizes and the number of colors respectively.

Output

Print the answer to the problem. As the answer can be quite a large number, you should print it modulo 109 + 7 (1000000007).

   Examples 
 
     input 
   
2 2 1

     output 
   
1

     input 
   
2 2 2

     output 
   
8

     input 
   
3 2 2

     output 
   
40

题意：给N*M的矩阵，用K种颜色将他们涂满，要求对于每一列i，1~i列和i+1~m列的颜色种类数相等，问方案数。

思路：突破点是第1列和第m列，有如下的事实：

①第1列和第m列的颜色种数要相等，否则当i=1和i=m时肯定有一个不满足要求（中间有其他的颜色种类）。

②中间的列颜色来源于第1列和第m列中的共同颜色，理由同上。

那么枚举首尾列的共同颜色数i和不同颜色数j即可，同时dp预处理，dp[i]表示N个格恰有i种颜色的方案数。那么显然dp[i] = i^n - sigma[dp[j]*C(i,j)]，j∈[1, i-1]，最后特别处理下M=1和2的情况就好，组合数用逆元打表快很多。

# include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 1e6;
const LL mod = 1e9+7;
LL inv[maxn+3] = {1,1}, fac[maxn+3] = {1,1}, fi[maxn+3] = {1,1};
LL dp[1003];
LL qmod(LL a, LL b)
{
    LL ans = 1;
    for(;b;b>>=1)
    {
        if(b&1) ans = ans*a%mod;
        a = a*a%mod;
    }
    return ans;
}
void init()
{
    for(int i=2; i<=maxn; ++i)
    {
        fac[i] = fac[i-1]*i%mod;
        inv[i] = (mod-mod/i)*inv[mod%i]%mod;
        fi[i] = fi[i-1]*inv[i]%mod;
    }
}
LL c(LL n, LL m)
{
    return fac[n]*fi[n-m]%mod*fi[m]%mod;
}
int main()
{
    init();
    LL n, m, k;
    scanf("%I64d%I64d%I64d",&n,&m,&k);
    LL ans = 0;
    if(m == 1)
        return 0*printf("%I64d\n",qmod(k, n));
    for(LL i=1; i<=min(n,k); ++i)
    {
        dp[i] = qmod(i, n);
        for(LL j=1; j<i; ++j)
            dp[i] = (dp[i] - dp[j]*c(i,j)%mod+mod)%mod;
    }
    if(m == 2)
    {
        for(LL i=1; i<=min(n,k); ++i)
        {
            LL tmp = dp[i]*dp[i]%mod;
            tmp = tmp*c(k,i)%mod*c(k,i)%mod;
            ans = (ans + tmp)%mod;
        }
    }
    else
    {
        for(LL i=1; i<=min(k, n); ++i)
        {
            for(LL j=0; j<=min(k, n); ++j)
            {
                if(j+j+i>k || i+j>n) break;
                LL tmp = dp[i+j]*dp[i+j]%mod;
                tmp = tmp*c(k, i)%mod*c(k-i, j)%mod*c(k-i-j, j)%mod;
                tmp = tmp*qmod(i,(m-2)*n)%mod;
                ans = (ans + tmp)%mod;
            }
        }
    }
    printf("%I64d\n",ans);
    return 0;
}