nowcoder20358 [SDOI2013]方程

链接

点击跳转

题解

规定某个变量$\ge a_i$，那么我可以先从总数中扣除$a_i-1$，然后隔板法求出每个变量都$\ge 1$的方案数，最后再把相应的$x_i$加上$a_i-1$，所以方案数其实就是$\left(\genfrac{}{}{0ex}{}{M-{\sum }_{a_i-1}-1}{n-1}\right)$

规定某个变量$\le a_i$，那么其对立面就是$>a_i$，容斥做即可

代码

#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 100010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#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;
}
ll mod;
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;
struct CombinatorialNumber_mod
{
    ll p[20], q[20], fact[20][maxn], tot, t[20];
    void init(ll P)
    {
        tot=0;
        ll i, j;
        for(i=2;i*i<=P;i++)
            if(P%i==0)
            {
                p[++tot]=i;
                q[tot]=0;
                while(P%i==0)q[tot]++, P/=i;
            }
        if(P>1)p[++tot]=P, q[tot]=1;
        rep(i,1,tot)
        {
            fact[i][0]=1;
            t[i]=1;
            rep(j,1,q[i])t[i]*=p[i];
            rep(j,1,maxn-1)
            {
                if(j%p[i]==0)fact[i][j]=fact[i][j-1];
                else fact[i][j]=fact[i][j-1]*j%t[i];
            }
        }
    }
    pll fact_mod(ll n, ll id)
    {
        if(n<p[id])return pll(0,fact[id][n]);
        pll ans = pll( n/p[id], em.fastpow(fact[id][t[id]],n/t[id],t[id]) );
        (ans.second*=fact[id][n%t[id]])%t[id];
        auto nex = fact_mod(n/p[id],id);
        ans.first+=nex.first;
        (ans.second*=nex.second)%=t[id];
        return ans;
    }
    ll exlucas(ll n, ll m, ll id)
    {
        ll cnt;
        auto a=fact_mod(n,id), b=fact_mod(m,id), c=fact_mod(n-m,id);
        a.first-=b.first+c.first;
        (a.second*=em.inv2(b.second*c.second%t[id],t[id]))%t[id];
        return em.fastpow(p[id],a.first,t[id])*a.second%t[id];
    }
    ll calc(ll n, ll m)
    {
        if(m>n or m<0 or n<0)return 0;
        vector<ll> a, v(t+1,t+tot+1);
        ll i;
        rep(i,1,tot)a.emb(exlucas(n,m,i));
        return em.CRT(a,v);
    }
}Cmod;
ll ans, n1, n2, n, M, a[20];
void dfs(ll pos, ll f, ll sm)
{
    if(pos>n1)
    {
        ( ans += f*Cmod.calc(M-sm-1,n-1) )%=mod;
        return;
    }
    dfs(pos+1,f,sm);
    dfs(pos+1,-f,sm+a[pos]);
}
int main()
{
    ll T, i, s;
    T=read(), mod=read();
    Cmod.init(mod);
    while(T--)
    {
        n=read(), n1=read(), n2=read(), M=read();
        rep(i,1,n1)a[i]=read();
        s=0;
        rep(i,n1+1,n1+n2)a[i]=read(), s+=a[i]-1;
        ans=0;
        dfs(1,1,s);
        printf("%lld\n",(ans+mod)%mod);
    }
    return 0;
}