Submission #1725127


Source Code Expand

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

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)      //repeat n times
#define REP2(i,s,n) for(int (i)=(s);(i)<(n);(i)++) //repeat from s to n 
#define ASIZE(a) (sizeof(a) / sizeof(a[0]))        //array size
#define SORTD(a) sort(a,a+ASIZE(a),greater<int>()) //sort in descending order for array
#define SORTA(a) sort(a,a+ASIZE(a))                //sort in ascending order for array
#define SORTS(a) sort(a.begin(),a.end())           //sort in ascending order for string type
typedef long long ll;

void SCAN(int *a){scanf("%d",a);}                             //scan for type int
void SCAN(int *a,int n){int i;REP(i,n){scanf("%d",&a[i]);}}   //scan for type int array
void SCAN(char *c){scanf(" %c",c);}                           //scan for type char
void SCAN(char *c,int n){int i;REP(i,n){scanf(" %c",&c[i]);}} //scan for type char array

const int MOD = 1000000007;

int pascalTri(int n,int r){
	int tri[n+1][n+1];
	int i,j;
	REP(i,n+1){REP(j,n+1){tri[i][j]=0;}}
	REP(i,n+1){
		REP(j,n+1){
			if(j>i){break;}
			if(j==0||j==i){tri[i][j]=1;}else{tri[i][j]=(tri[i-1][j-1]%MOD+tri[i-1][j]%MOD)%MOD;}
		}
	}
	return tri[n][r];
}

const int DX4[4]= {-1,0,0,1};
const int DY4[4]= {0,-1,1,0};

int main(){
	int r,c,x,y,d,l;
	int i,j;

	SCAN(&r);SCAN(&c);
	SCAN(&x);SCAN(&y);
	SCAN(&d);SCAN(&l);

	ll ans = (r-x+1)*(c-y+1);
	
	ans = (ans*pascalTri(x*y,d))%MOD;

	printf("%lld\n",ans);

	return 0;
}

Submission Info

Submission Time
Task D - AtCoder社の冬
User nabe12
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1486 Byte
Status WA
Exec Time 6 ms
Memory 3456 KB

Compile Error

./Main.cpp: In function ‘void SCAN(int*)’:
./Main.cpp:12:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void SCAN(int *a){scanf("%d",a);}                             //scan for type int
                                ^
./Main.cpp: In function ‘void SCAN(int*, int)’:
./Main.cpp:13:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void SCAN(int *a,int n){int i;REP(i,n){scanf("%d",&a[i]);}}   //scan for type int array
                                                         ^
./Main.cpp: In function ‘void SCAN(char*)’:
./Main.cpp:14:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void SCAN(char *c){scanf(" %c",c);}                           //scan for type char
                                  ^
./Main.cpp: In function ‘void SCAN(char*, int)’:
./Main.cpp:15:59: wa...

Judge Result

Set Name sub All
Score / Max Score 100 / 100 0 / 1
Status
AC × 25
AC × 25
WA × 27
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 1 ms 256 KB
00_sample_02E.txt AC 1 ms 256 KB
00_sample_03E.txt AC 1 ms 384 KB
00_sample_04.txt WA 3 ms 1280 KB
test_01.txt WA 1 ms 256 KB
test_02.txt WA 1 ms 256 KB
test_03E.txt AC 1 ms 256 KB
test_04E.txt AC 2 ms 896 KB
test_05.txt WA 1 ms 256 KB
test_06.txt WA 3 ms 1792 KB
test_07E.txt AC 1 ms 256 KB
test_08E.txt AC 2 ms 384 KB
test_09.txt WA 2 ms 512 KB
test_10.txt WA 3 ms 1152 KB
test_11E.txt AC 2 ms 384 KB
test_12E.txt AC 2 ms 768 KB
test_13.txt WA 1 ms 256 KB
test_14.txt WA 6 ms 3456 KB
test_15E.txt AC 2 ms 1024 KB
test_16E.txt AC 6 ms 3456 KB
test_17.txt WA 1 ms 256 KB
test_18.txt WA 1 ms 256 KB
test_19E.txt AC 1 ms 256 KB
test_20E.txt AC 1 ms 256 KB
test_21.txt WA 1 ms 256 KB
test_22.txt WA 3 ms 1152 KB
test_23E.txt AC 1 ms 256 KB
test_24E.txt AC 3 ms 1920 KB
test_25.txt WA 2 ms 384 KB
test_26.txt WA 1 ms 256 KB
test_27E.txt AC 2 ms 768 KB
test_28E.txt AC 3 ms 1408 KB
test_29.txt WA 5 ms 2944 KB
test_30.txt WA 5 ms 3456 KB
test_31E.txt AC 1 ms 384 KB
test_32E.txt AC 5 ms 3456 KB
test_33.txt WA 1 ms 256 KB
test_34.txt WA 1 ms 256 KB
test_35.txt WA 1 ms 256 KB
test_36E.txt AC 1 ms 256 KB
test_37E.txt AC 1 ms 256 KB
test_38E.txt AC 1 ms 256 KB
test_39E.txt AC 1 ms 256 KB
test_40.txt WA 1 ms 256 KB
test_41.txt WA 1 ms 256 KB
test_42.txt WA 1 ms 256 KB
test_43.txt WA 1 ms 256 KB
test_44.txt WA 1 ms 256 KB
test_45E.txt AC 1 ms 256 KB
test_46.txt WA 1 ms 256 KB
test_47E.txt AC 1 ms 256 KB
test_48.txt WA 1 ms 256 KB