Submission #123041

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;

const int MAXN = 950;
LL comb[MAXN][MAXN];
LL MOD = 1000000007;
void init() {
  for(int i=0; i<MAXN; i++)
    comb[i][i] = comb[i][0] = 1;
  for(int i=0; i<MAXN; i++)
    for(int j=1; j<i; j++) {
      comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
      comb[i][j] %= MOD;
    }
}

int D, L;
LL calc(int x, int y) {
  if(x<0 || y<0) return 0;
  if(x*y<D+L) return 0;
  LL ret = comb[x*y][D] * comb[x*y-D][L] % MOD;
  return ret;
}

int main() {
  init();
  LL R,C, X,Y;
  
  cin>>R>>C>>X>>Y>>D>>L;
  
  LL ans = calc(X,Y) - 2*calc(X-1,Y) - 2*calc(X,Y-1)
    + 4*calc(X-1, Y-1) + calc(X-2, Y) + calc(X, Y-2)
    - 2*calc(X-2, Y-1) - 2*calc(X-1, Y-2) + calc(X-2, Y-2);
  ans %= MOD;
  ans += MOD;
  ans %= MOD;
  ans *= (R-X+1) * (C-Y+1);
  ans %= MOD;
  cout<<ans<<endl;
  
  return 0;
}

Submission Info

Judge Result