Submission #123141
Source Code Expand
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>
#include <complex>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef pair<int, TIII> QIIII;
typedef long long LL;
typedef vector<LL> VLL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
LL comb[1000][1000];
LL solve2(int x, int y, int d, int l){
if(x*y < d+l || x<0 ||y < 0)return 0LL;
return ((comb[x*y][d]*comb[x*y-d][l]) % MOD);
}
int main(){
int r,c,x,y,d,l;
cin>>r>>c>>y>>x>>d>>l;
REP(i,1000){
comb[i][0]=1;
comb[i][i]=1;
FOR(j,1,i)comb[i][j]=(comb[i-1][j-1]+comb[i-1][j])%MOD;
}
LL ret1=(c-x+1)*(r-y+1) % MOD;
LL ret2=solve2(x,y,d,l);
ret2 += 2*MOD-2*solve2(x-1,y,d,l)+solve2(x-2,y,d,l);
ret2 %= MOD;
ret2 += 2*MOD-2*solve2(x,y-1,d,l)+solve2(x,y-2,d,l);
ret2 %= MOD;
ret2 += 4*solve2(x-1,y-1,d,l);
ret2 %= MOD;
ret2 += 2*MOD-2*solve2(x-2,y-1,d,l);
ret2 %= MOD;
ret2 += 2*MOD-2*solve2(x-1,y-2,d,l);
ret2 %= MOD;
ret2 += solve2(x-2,y-2,d,l);
ret2 %= MOD;
LL ret = (ret1*ret2)%MOD;
cout << ret << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - AtCoder社の冬 |
User |
UminchuR |
Language |
C++ (G++ 4.6.4) |
Score |
101 |
Code Size |
2365 Byte |
Status |
AC |
Exec Time |
43 ms |
Memory |
7708 KB |
Judge Result
Set Name |
sub |
All |
Score / Max Score |
100 / 100 |
1 / 1 |
Status |
|
|
Set Name |
Test Cases |
sub |
00_sample_01E.txt, 00_sample_02E.txt, 00_sample_03E.txt, test_03E.txt, test_04E.txt, test_07E.txt, test_08E.txt, test_11E.txt, test_12E.txt, test_15E.txt, test_16E.txt, test_19E.txt, test_20E.txt, test_23E.txt, test_24E.txt, test_27E.txt, test_28E.txt, test_31E.txt, test_32E.txt, test_36E.txt, test_37E.txt, test_38E.txt, test_39E.txt, test_45E.txt, test_47E.txt |
All |
00_sample_01E.txt, 00_sample_02E.txt, 00_sample_03E.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03E.txt, test_04E.txt, test_05.txt, test_06.txt, test_07E.txt, test_08E.txt, test_09.txt, test_10.txt, test_11E.txt, test_12E.txt, test_13.txt, test_14.txt, test_15E.txt, test_16E.txt, test_17.txt, test_18.txt, test_19E.txt, test_20E.txt, test_21.txt, test_22.txt, test_23E.txt, test_24E.txt, test_25.txt, test_26.txt, test_27E.txt, test_28E.txt, test_29.txt, test_30.txt, test_31E.txt, test_32E.txt, test_33.txt, test_34.txt, test_35.txt, test_36E.txt, test_37E.txt, test_38E.txt, test_39E.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45E.txt, test_46.txt, test_47E.txt, test_48.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01E.txt |
AC |
32 ms |
7596 KB |
00_sample_02E.txt |
AC |
33 ms |
7584 KB |
00_sample_03E.txt |
AC |
33 ms |
7584 KB |
00_sample_04.txt |
AC |
33 ms |
7576 KB |
test_01.txt |
AC |
33 ms |
7588 KB |
test_02.txt |
AC |
33 ms |
7588 KB |
test_03E.txt |
AC |
36 ms |
7660 KB |
test_04E.txt |
AC |
31 ms |
7572 KB |
test_05.txt |
AC |
31 ms |
7588 KB |
test_06.txt |
AC |
32 ms |
7588 KB |
test_07E.txt |
AC |
34 ms |
7668 KB |
test_08E.txt |
AC |
32 ms |
7592 KB |
test_09.txt |
AC |
32 ms |
7588 KB |
test_10.txt |
AC |
33 ms |
7596 KB |
test_11E.txt |
AC |
33 ms |
7580 KB |
test_12E.txt |
AC |
33 ms |
7592 KB |
test_13.txt |
AC |
31 ms |
7584 KB |
test_14.txt |
AC |
33 ms |
7596 KB |
test_15E.txt |
AC |
32 ms |
7588 KB |
test_16E.txt |
AC |
33 ms |
7588 KB |
test_17.txt |
AC |
31 ms |
7584 KB |
test_18.txt |
AC |
32 ms |
7584 KB |
test_19E.txt |
AC |
43 ms |
7592 KB |
test_20E.txt |
AC |
32 ms |
7588 KB |
test_21.txt |
AC |
32 ms |
7584 KB |
test_22.txt |
AC |
32 ms |
7588 KB |
test_23E.txt |
AC |
33 ms |
7592 KB |
test_24E.txt |
AC |
33 ms |
7588 KB |
test_25.txt |
AC |
32 ms |
7592 KB |
test_26.txt |
AC |
32 ms |
7588 KB |
test_27E.txt |
AC |
32 ms |
7596 KB |
test_28E.txt |
AC |
32 ms |
7588 KB |
test_29.txt |
AC |
34 ms |
7660 KB |
test_30.txt |
AC |
33 ms |
7588 KB |
test_31E.txt |
AC |
31 ms |
7628 KB |
test_32E.txt |
AC |
33 ms |
7588 KB |
test_33.txt |
AC |
32 ms |
7704 KB |
test_34.txt |
AC |
35 ms |
7664 KB |
test_35.txt |
AC |
33 ms |
7644 KB |
test_36E.txt |
AC |
33 ms |
7576 KB |
test_37E.txt |
AC |
32 ms |
7672 KB |
test_38E.txt |
AC |
33 ms |
7588 KB |
test_39E.txt |
AC |
33 ms |
7588 KB |
test_40.txt |
AC |
33 ms |
7652 KB |
test_41.txt |
AC |
32 ms |
7588 KB |
test_42.txt |
AC |
32 ms |
7584 KB |
test_43.txt |
AC |
32 ms |
7584 KB |
test_44.txt |
AC |
33 ms |
7672 KB |
test_45E.txt |
AC |
32 ms |
7588 KB |
test_46.txt |
AC |
33 ms |
7596 KB |
test_47E.txt |
AC |
33 ms |
7708 KB |
test_48.txt |
AC |
33 ms |
7652 KB |