Submission #122993

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>
using namespace std;

#ifdef _MSC_VER
#include "_lib_msc.h"
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define REPEAT(i, k, n)     for(int(i)=(k);(i)<((k)+(n));++(i))
#define RREP(i, n)          for(int(i)=(n)-1;(i)>=0;--(i))
#define RREPEAT(i, k, n)    for(int(i)=(k)+(n)-1;(i)>=(k);--(i))
#define FROMTO(i,f,t)       for(int(i)=(f);(i)<(t);(++i))
#define ALL(c)              (c).begin(), (c).end()
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p2<p1)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
inline int clz(ui n){return n==0?32:__builtin_clz(n);}
inline int clz(ull n){return n==0?64:__builtin_clzll(n);}
inline int crz(ui n){return n==0?32:__builtin_ctz(n);}
inline int crz(ull n){return n==0?64:__builtin_ctzll(n);}
inline int bitc(ui n){return __builtin_popcount(n);}
inline int bitc(ull n){return __builtin_popcountll(n);} 
#ifdef _DEBUG
#include "_lib_dbg.h"
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

const int MOD = 1000000007;

int dp[900][900][2][2][2][2];

vector<vector<ll> > c;
void combination_gen(int n, vector<vector<ll> > &c){
    c.resize(n+1); REP(i,n+1) c[i].resize(n+1); c[0][0] = 1;
    REPEAT(i,1,n) REP(j,i+1) c[i][j] = (c[i-1][j] + (j > 0 ? c[i-1][j-1] : 0)) % MOD;
}

int R,C,X,Y,D,L,M;
ll dfs(int i, int b, int f1, int f2, int f3, int f4){
    if(i == M){
        if(b||!f1||!f2||!f3||!f4) return 0;
        return 1;
    }
    int x = i%X, y = i/X;
    if(dp[i][b][f1][f2][f3][f4] >= 0) return dp[i][b][f1][f2][f3][f4];
    ll res = 0;
    
    res += dfs(i+1, b-1, f1|(x==0), f2|(y==0), f3|(x==X-1), f4|(y==Y-1));
    res += dfs(i+1, b, f1, f2, f3, f4);
    res %= MOD;

    return (dp[i][b][f1][f2][f3][f4] = res);
}

int main(){
    cin >>R>>C>>X>>Y>>D>>L;
    M = X*Y;
    FILL(dp,-1);
    ll p = dfs(0,D+L,0,0,0,0);

    combination_gen(901, c);

    p = (p * c[L+D][L]) % MOD;
    p = (p * (R-X+1)) % MOD;
    p = (p * (C-Y+1)) % MOD;
    cout << p << endl;
}

Submission Info

Judge Result