Submission #122318

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
lint co[1100][1100];
lint mo=1000000007;
lint cal(int x,int y,int d){
	if(x<0 || y<0) return 0;return co[x*y][d];
}
int main()
{
	memset(co,0,sizeof(co));
	int r,c,x,y,d,l;
	rep(i,1050){
		co[i][0]=co[i][i]=1;
		REP(j,1,i) co[i][j]=(co[i-1][j]+co[i-1][j-1])%mo;
	}
	cin>>r>>c;
	cin>>x>>y;
	cin>>d>>l;
	lint out=cal(x,y,d+l);
	out-=cal(x-1,y,d+l)*2+cal(x,y-1,d+l)*2;
	out+=cal(x-1,y-1,d+l)*4+cal(x-2,y,d+l)+cal(x,y-2,d+l);
	out-=cal(x-2,y-1,d+l)*2+cal(x-1,y-2,d+l)*2;
	out+=cal(x-2,y-2,d+l);//cout<<co[4][2]<<endl;
	out=(out%mo+mo)%mo;out*=co[d+l][l];out%=mo;
	cout<<((out*(r-x+1)*(c-y+1)))%mo<<endl;
}

Submission Info

Judge Result