Paint Box

题解：

我们知道至少涂k种颜色并且相邻两个不相邻的方案数为:$k(k-1{)}^{n-1}$。然后容斥一下就可以了。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const int maxn=1e6+10;
int T;
ll p[maxn], invp[maxn], inv[maxn];
ll qp(ll a, ll b){
    a %= mod;
    ll ret = 1;
    while(b){
        if (b & 1)
            ret = ret * a % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ret;
}
void init(){
    p[0] = 1;
    for(int i = 1; i <= 1000000; i++)
        p[i] = p[i - 1] * i % mod;
    invp[1000000] = qp(p[1000000], mod - 2);
    for(int i = 1000000 - 1; i>=0; i--)
        invp[i] = invp[i + 1] * (i + 1) % mod;
    inv[1] = 1;
    for(int i = 2; i <= 1000000; i++)
        inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
}
ll C(ll n, ll m){
    return p[n] * invp[m] % mod * invp[n - m] % mod;
}
signed main()
{
    init();
    scanf("%d",&T);
    while(T--)
    {
        ll n,m,k;
        scanf("%lld%lld%lld",&n,&m,&k);
        ll Cmk = 1;
        for(int i=1;i<=k;i++){
            Cmk=Cmk*inv[i]%mod*(m-i+1)%mod;
        }
        ll tmp = 0;
        for(int i=0; i<k; i++)
            if (i % 2 == 0)
                tmp = (tmp + C(k, k-i) * (k - i) % mod * qp(k - i - 1, n - 1) % mod + mod) % mod;
            else
                tmp = (tmp - C(k, k-i) * (k - i) % mod * qp(k - i - 1, n - 1) % mod + mod) % mod;
        ll ans = Cmk * tmp % mod;
        printf("%lld\n", ans);
    }
    return 0;
}