题解:
将组合数看做网格图上的单增路径之后
O(|X|2)
O
(
|
X
|
2
)
做DP即可。
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int RLEN=1<<18|1;
inline char nc() {
static char ibuf[RLEN],*ib,*ob;
(ib==ob) && (ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob) ? -1 : *ib++;
}
inline int rd() {
char ch=nc(); int i=0,f=1;
while(!isdigit(ch)) {if(ch=='-')f=-1; ch=nc();}
while(isdigit(ch)) {i=(i<<1)+(i<<3)+ch-'0'; ch=nc();}
return i*f;
}
const int mod=1e9+7;
inline int add(int x,int y) {return (x+y>=mod) ? (x+y-mod) : (x+y);}
inline int dec(int x,int y) {return (x-y<0) ? (x-y+mod) : (x-y);}
inline int mul(int x,int y) {return (LL)x*y%mod;}
inline int power(int a,int b,int rs=1) {
for(;b;b>>=1,a=mul(a,a)) if(b&1) rs=mul(rs,a);
return rs;
}
const int N=2e5+50, M=8e3+50;
int n,A[N],B[N],fac[M],ifac[M],f[4500][4500];
inline int& F(int a,int b) {return f[a+2003][b+2003];}
inline int C(int a,int b) {return mul(fac[a], mul(ifac[b], ifac[a-b]));}
int main() {
fac[0]=1;
for(int i=1;i<M;i++) fac[i]=mul(fac[i-1],i);
ifac[M-1]=power(fac[M-1],mod-2);
for(int i=M-2;~i;i--) ifac[i]=mul(ifac[i+1],i+1);
n=rd();
for(int i=1;i<=n;i++) A[i]=rd(), B[i]=rd(), F(-A[i],-B[i])++;//, cerr<<A[i]<<" "<<B[i]<<endl;
for(int i=-2000;i<=2000;++i)
for(int j=-2000;j<=2000;++j) {
F(i,j)=add(F(i,j),F(i-1,j));
F(i,j)=add(F(i,j),F(i,j-1));
}
int ans=0;
for(int i=1;i<=n;i++) ans=add(ans,F(A[i],B[i])), ans=dec(ans,C(2*A[i]+2*B[i],2*B[i])); cout<<mul(ans,(mod+1)/2);
}