nowcoder20189 [JSOI2011]分特产

链接

点击跳转

题解

这题就是说有一个$n$行$m$列的矩阵，每行的和都不为$0$，第$j$列的和为$a_j$，让你统计这样的矩阵有多少个

枚举和为$0$的行，然后容斥即可

代码

#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 2020
#define maxe 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;
}
#define mod 1000000007ll
ll fact[maxn], _fact[maxn], a[maxn], inv[maxn];
ll C(ll n, ll m)
{
    if(m>n or m<0 or n<0)return 0;
    return fact[n]*_fact[m]%mod*_fact[n-m]%mod;
}
int main()
{
    ll ans=0, i, j, n, m;
    n=read(), m=read();
    rep(i,m)a[i]=read();
    inv[1]=1;
    for(int i=2;i<maxn;i++)inv[i]=inv[mod%i]*(mod-mod/i)%mod;
    fact[0]=_fact[0]=1;
    rep(i,maxn-1)fact[i]=fact[i-1]*i%mod, _fact[i]=_fact[i-1]*inv[i]%mod;
    for(i=0;i<=n;i++)
    {
        ll t=1, s=n-i;
        for(j=1;j<=m;j++)
        {
            t*=C(a[j]+s-1,s-1);
            t%=mod;
        }
        t=t*C(n,i)%mod;
        if(i&1)ans-=t;
        else ans+=t;
        ans%=mod;
    }
    printf("%lld",(ans%mod+mod)%mod);
    return 0;
}