Submission #2117459

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define int ll
typedef vector<int> vi;
typedef pair<int,int> pii;


long long factorical(int n)
{
  long long ans=1,i;
  for(i=n;i>1;i--)
    ans=(ans*i)%MOD;
  return ans;
}

long long beki(long long a,int n)
{
  long long s=1LL;
  while(n){
    if(n%2)s=(s*a)%MOD;
    a=(a*a)%MOD;
    n/=2;
  }
  return s;
}

long long ncr(int n,int r)
{
  long long a=factorical(n);
  long long b=(factorical(r)*factorical(n-r))%MOD;
  return (a*beki(b,MOD-2))%MOD;
}



signed main(void) {
  int i,j;
  int r,c;
  cin>>r>>c;
  int x,y,d,l;
  cin>>x>>y>>d>>l;
  int ans=((r-x+1)*(c-y+1))%MOD;
  ans=(ans*ncr(d+l,d))%MOD;

  int tmp=ncr(x*y,d+l);

  int tmp1=0;
  if((x-1)*y>d+l)tmp1+=2*ncr((x-1)*y,d+l);
  if(x*(y-1)>d+l)tmp1+=2*ncr(x*(y-1),d+l);
  tmp1%=MOD;
  int tmp2=0;
  if((x-1)*(y-1)>d+l)tmp2=4*ncr((x-1)*(y-1),d+l);
  tmp2%=MOD;
  int tmp3=0;
  if((x-2)*(y-1)>d+l)tmp3+=2*ncr((x-2)*(y-1),d+l);
  if((x-1)*(y-2)>d+l)tmp3+=2*ncr((x-1)*(y-2),d+l);
  tmp3%=MOD;
  int tmp4=0;
  if((x-2)*(y-2)>d+l)tmp4+=ncr((x-2)*(y-2),d+l);
  tmp4%=MOD;

  tmp=(tmp-(tmp1-tmp2+tmp3-tmp4)+MOD)%MOD;

  cout<<(ans*tmp)%MOD<<endl;
}

Submission Info

Judge Result