Submission #123093

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include<cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include<bitset>

#define REP(i,b,n) for(int i=b;i<(int)n;i++)
#define rep(i,n)   REP(i,0,n)
#define ALL(C)     (C).begin(),(C).end()
#define FOR(it,o)  for(__typeof((o).begin()) it=(o).begin(); it!=(o).end(); ++it)
#define dbg(x) cout << __LINE__ << ' ' << #x << " = " << (x) << endl


typedef long long ll;

using namespace std;

//ハマったらチェックリスト見ろ!!

const int N = 30;
// (basho) * (left) * (right) * (top) * bottom

//重複組合せの総数
//a[i]個あるn種類のものからm個選ぶときの組み合わせの数

ll MOD = 1000000007;


ll comb[N*N+1][N*N+1];

void makeComb(){
  rep(i, N*N+1)rep(j, N*N+1)comb[i][j] = 0;
  rep(i, N*N+1){
    comb[i][0] = 1;
  }
  REP(i, 1, N*N+1){
    REP(j, 1, N*N+1){
      comb[i][j] = (comb[i-1][j-1] + comb[i-1][j])%MOD;
    }
  }
}

ll solve1(ll space, ll d, ll l){
  if(min(space, min(d, l)) < 0)return 0;
  ll ret = comb[space][d+l];
  ret *= comb[d+l][l];
  ret %=MOD;
  return ret;
}


int main(){
  int R, C;
  makeComb();
  while(cin >> R >> C){

    int X, Y, D, L;
    cin >> X >> Y;
    cin >> D >> L;
    swap(X, Y);
    if(X == 1 && Y == 1){
      if(D + L == 1){
	cout << R*C << endl;
      }
      else cout << 0 <<endl;
      continue;
    }
    // y, x, 

    ll ans = 0;
    rep(x1, C){
      rep(y1, R){
	int x2 = x1 + X-1;
	int y2 = y1 + Y -1;
	if(x2 >= C || y2 >= R)continue;
	ans += solve1(X*Y, D, L);
	ans %=MOD;
	rep(xx1, 2){
	  rep(xx2, 2){
	    rep(yy1, 2){
	      rep(yy2, 2){
		if(xx1 + xx2 + yy1 + yy2 == 0)continue;
		//plus
		if((xx1  + xx2 + yy1 + yy2)% 2){
		  ll hoge = X*Y;
		  hoge -= (xx1+xx2)*Y + (yy1+yy2)*X;
		  if(xx1 == 1)hoge += (yy1 + yy2);
		  if(xx2 == 1)hoge += (yy1 + yy2);
		  ans -= solve1(hoge, D, L);
		  ans = (ans + MOD)%MOD;
		}else{
		  //minus
		  ll hoge = X*Y;
		  hoge -= (xx1+xx2)*Y + (yy1+yy2)*X;
		  if(xx1 == 1)hoge += (yy1 + yy2);
		  if(xx2 == 1)hoge += (yy1 + yy2);
		  ans += solve1(hoge, D, L);
		  ans = (ans + MOD)%MOD;
		}
	      }
	    }
	  }
	}
      }
    }
    cout << ans <<endl;
  }
  return 0;
}

Submission Info

Judge Result