Submission #3817911

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int R,C;
int X,Y;
int D,L;
long int memo[901][901];

int bitcount(int i){
    int j=i;
    int ans=0;
    while(j!=0){
        if(j%2==1) ans++;
        j=j/2;
    }
    return ans;
}

long int comb(int n,int p){
    long int ans;
    if(n<0) return 0;
    if(memo[n][p]!=-1) return memo[n][p];
    if(p>n) return memo[n][p]=0;
    if(n==0||p==0) return memo[n][p]=1;
    if(n==p) return memo[n][p]=1;
    ans = comb(n-1,p-1) + comb(n-1,p);
    ans = ans % 1000000007;
    return memo[n][p] = ans;
}

long int Pt(int x,int y){
    long int ans = comb(x*y,D+L);
    for(int i=1;i<(1<<4);i++){
        int tx=x;
        int ty=y;
        if((i>>0 & 1)==1) tx--;
        if((i>>1 & 1)==1) tx--;
        if((i>>2 & 1)==1) ty--;
        if((i>>3 & 1)==1) ty--;

        if(bitcount(i)%2 == 0) ans+=comb(tx*ty,D+L);
        else ans-=comb(tx*ty,D+L);
    }
    return ans%1000000007;
}

int main(){
    memset(memo,-1,sizeof(memo));
    cin >> R >> C;
    cin >> X >> Y;
    cin >> D >> L;
    if(X*Y==D+L){
        cout << ((R-X+1)*(C-Y+1)*comb(X*Y,D))%1000000007 << endl;
    }else{
        int ans = (Pt(X,Y)*comb(D+L,D))%1000000007;
        cout << ((R-X+1)*(C-Y+1)*ans)%1000000007 << endl;
    }
    return 0;
}

Submission Info

Judge Result