洛谷P4071 [SDOI2016]排列计数

链接

https://www.luogu.com.cn/problem/P4071

题解

先选$m$个，让这$m$个稳定，然后剩下的必须满足"每个数字都不稳定"，用$f(n)$表示$n$个数字的排列，每个数字都不稳定的方案数。

$$f(n)=\sum _{i=0}^n(-1{)}^i(\genfrac{}{}{0ex}{}{n}{i})(n-i)!=\sum _{i=0}^n(-1{)}^i\frac{n!}{i!}=n!\sum _{i=0}^n(-1{)}^i(i!{)}^{-1}$$

预处理${\sum }_{i=0}^n(-1{)}^i(i!{)}^{-1}$即可线性得到$f(1)$到$f(n)$

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
struct EasyMath
{
    ll prime[maxn], phi[maxn], mu[maxn];
    bool mark[maxn];
    ll fastpow(ll a, ll b, ll c)
    {
        ll t(a%c), ans(1ll);
        for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
        return ans;
    }
    void exgcd(ll a, ll b, ll &x, ll &y)
    {
        if(!b){x=1,y=0;return;}
        ll xx, yy;
        exgcd(b,a%b,xx,yy);
        x=yy, y=xx-a/b*yy;
    }
    ll inv(ll x, ll p)  //p是素数
    {return fastpow(x%p,p-2,p);}
    ll inv2(ll a, ll p)
    {
        ll x, y;
        exgcd(a,p,x,y);
        return (x+p)%p;
    }
    void shai(ll N)
    {
        ll i, j;
        for(i=2;i<=N;i++)mark[i]=false;
        *prime=0;
        phi[1]=mu[1]=1;
        for(i=2;i<=N;i++)
        {
            if(!mark[i])prime[++*prime]=i, mu[i]=-1, phi[i]=i-1;
            for(j=1;j<=*prime and i*prime[j]<=N;j++)
            {
                mark[i*prime[j]]=true;
                if(i%prime[j]==0)
                {
                    phi[i*prime[j]]=phi[i]*prime[j];
                    break;
                }
                mu[i*prime[j]]=-mu[i];
                phi[i*prime[j]]=phi[i]*(prime[j]-1);
            }
        }
    }
    ll CRT(vector<ll> a, vector<ll> m) //要求模数两两互质
    {
        ll M=1, ans=0, n=a.size(), i;
        for(i=0;i<n;i++)M*=m[i];
        for(i=0;i<n;i++)(ans+=a[i]*(M/m[i])%M*inv2(M/m[i],m[i]))%=M;
        return ans;
    }
}em;
#define mod 1000000007ll
ll fact[maxn], _fact[maxn], f[maxn], s[maxn], inv[maxn];
ll C(ll n, ll m)
{
    if(m>n or m<0)return 0;
    return fact[n]*_fact[m]%mod*_fact[n-m]%mod;
}
int main()
{
    ll T=read(), i, kase;
    inv[1]=1; for(i=2;i<maxn;i++)inv[i]=inv[mod%i]*(mod-mod/i)%mod;
    fact[0]=_fact[0]=1;
    rep(i,1e6)fact[i]=fact[i-1]*i%mod, _fact[i]=_fact[i-1]*inv[i]%mod;
    f[0]=1;
    s[0]=1;
    rep(i,1e6)
    {
        if(i&1)s[i]=(s[i-1]+mod-_fact[i])%mod;
        else s[i]=(s[i-1]+_fact[i])%mod;
        f[i]=fact[i]*s[i]%mod;
    }
    while(T--)
    {
        ll n=read(), m=read(), ans=C(n,m)*f[n-m]%mod;
        printf("%lld\n",ans);
    }
    return 0;
}