AGC 001 E BBQ Hard - dp

经典问题了

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define gc getchar()
#define lint long long
#define mod 1000000007
#define debug(x) cerr<<#x<<"="<<x
#define sp <<" "
#define ln <<endl
#define f(x,y) dp[(x)+BAS+5][(y)+BAS+5]
#define N 200010
#define BAS 2010
#define rep(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
inline int inn() { int x,ch;while((ch=gc)<'0'||ch>'9');x=ch^'0';while((ch=gc)>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^'0');return x; }
int a[N],b[N],dp[BAS*2+100][BAS*2+100],fac[N],facinv[N];
inline int fast_pow(int x,int k,int ans=1) { for(;k;k>>=1,x=(lint)x*x%mod) (k&1)?ans=(lint)ans*x%mod:0;return ans; }
inline int S(int n)
{
    rep(i,1,n) f(-a[i],-b[i])++;int ans=0;
    rep(i,-BAS,BAS) rep(j,-BAS,BAS) if(f(i,j)) f(i+1,j)+=f(i,j),f(i,j+1)+=f(i,j),(f(i+1,j)>=mod?f(i+1,j)-=mod:0),(f(i,j+1)>=mod?f(i,j+1)-=mod:0);
    rep(i,1,n) ans+=f(a[i],b[i]),(ans>=mod?ans-=mod:0);return ans;
}
inline int prelude(int n)
{
    rep(i,fac[0]=1,n) fac[i]=(lint)fac[i-1]*i%mod;facinv[n]=fast_pow(fac[n],mod-2);
    for(int i=n-1;i>=0;i--) facinv[i]=(i+1ll)*facinv[i+1]%mod;return 0;
}
inline int C(int n,int m) { return (lint)fac[n]*facinv[n-m]%mod*facinv[m]%mod; }
int main()
{
    int n=inn();rep(i,1,n) a[i]=inn(),b[i]=inn();int ans=S(n);prelude(10000);
    rep(i,1,n) ans-=C(2*a[i]+2*b[i],2*a[i]),(ans<0?ans+=mod:0);
    return !printf("%lld\n",(lint)fast_pow(2,mod-2)*ans%mod);
}