Submission #1750291


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 REPD(i,n) for(int (i)=(n);(i)>=0;(i)--)    //repeat from n to 0
#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(ll *a){scanf("%lld",a);}                            //scan for type long long int
void SCAN(ll *a,int n){int i;REP(i,n){scanf("%lld",&a[i]);}}  //scan for type long long 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;
const int INF = 1000000000;
 
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 w,h;
int n;
int X[30]={0},Y[30]={0};
ll dp[101][101][101][101]={0};

ll dfs(int x1,int y1,int x2,int y2){
	if(dp[x1][y1][x2][y2]!=0){return dp[x1][y1][x2][y2];}
	ll ret=0;
	ll temp;
	REP(i,n){
		temp=0;
		if(x1<=X[i]&&X[i]<=x2&&y1<=Y[i]&&Y[i]<=y2){
			temp=(x2-x1)+(y2-y1)+1;
			temp+=dfs(X[i]+1,Y[i]+1,x2,y2);
			temp+=dfs(x1,Y[i]+1,X[i]-1,y2);
			temp+=dfs(X[i]+1,y1,x2,Y[i]-1);
			temp+=dfs(x1,y1,X[i]-1,Y[i]-1);
		}
		ret=max(ret,temp);
	}
	dp[x1][y1][x2][y2]=ret;
	return ret;
}
int main(){
	
	int i,j,k;
 
	SCAN(&w);SCAN(&h);
	SCAN(&n);
	REP(i,n){
		SCAN(&X[i]);SCAN(&Y[i]);
	}

	printf("%lld\n",dfs(1,1,w,h));
	return 0;
}

Submission Info

Submission Time
Task D - 金塊ゲーム
User nabe12
Language C++14 (GCC 5.4.1)
Score 99
Code Size 2235 Byte
Status RE
Exec Time 111 ms
Memory 254208 KB

Compile Error

./Main.cpp: In function ‘void SCAN(int*)’:
./Main.cpp:13: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:14: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(ll*)’:
./Main.cpp:15:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void SCAN(ll *a){scanf("%lld",a);}                            //scan for type long long int
                                 ^
./Main.cpp: In function ‘void SCAN(ll*, int)’:
./Main.cpp:16:58...

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 80 / 80 19 / 19 0 / 1
Status
AC × 3
AC × 25
AC × 50
AC × 50
RE × 25
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt
Subtask3 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt, subtask3_13.txt, subtask3_14.txt, subtask3_15.txt, subtask3_16.txt, subtask3_17.txt, subtask3_18.txt, subtask3_19.txt, subtask3_20.txt, subtask3_21.txt, subtask3_22.txt, subtask3_23.txt, subtask3_24.txt, subtask3_25.txt
Case Name Status Exec Time Memory
sample_01.txt AC 3 ms 10496 KB
sample_02.txt AC 3 ms 12544 KB
sample_03.txt AC 7 ms 28928 KB
subtask1_01.txt AC 4 ms 14592 KB
subtask1_02.txt AC 3 ms 12544 KB
subtask1_03.txt AC 6 ms 26880 KB
subtask1_04.txt AC 8 ms 35072 KB
subtask1_05.txt AC 5 ms 20736 KB
subtask1_06.txt AC 4 ms 14592 KB
subtask1_07.txt AC 5 ms 18688 KB
subtask1_08.txt AC 2 ms 6400 KB
subtask1_09.txt AC 8 ms 35072 KB
subtask1_10.txt AC 4 ms 14592 KB
subtask1_11.txt AC 7 ms 30976 KB
subtask1_12.txt AC 6 ms 24832 KB
subtask1_13.txt AC 5 ms 22784 KB
subtask1_14.txt AC 9 ms 41216 KB
subtask1_15.txt AC 14 ms 67840 KB
subtask1_16.txt AC 8 ms 37120 KB
subtask1_17.txt AC 7 ms 33024 KB
subtask1_18.txt AC 8 ms 35072 KB
subtask1_19.txt AC 6 ms 26880 KB
subtask1_20.txt AC 7 ms 28928 KB
subtask1_21.txt AC 10 ms 45312 KB
subtask1_22.txt AC 13 ms 61696 KB
subtask1_23.txt AC 9 ms 39168 KB
subtask1_24.txt AC 14 ms 67840 KB
subtask1_25.txt AC 13 ms 63744 KB
subtask2_01.txt AC 14 ms 65920 KB
subtask2_02.txt AC 14 ms 67840 KB
subtask2_03.txt AC 30 ms 143616 KB
subtask2_04.txt AC 40 ms 166144 KB
subtask2_05.txt AC 32 ms 151808 KB
subtask2_06.txt AC 33 ms 151936 KB
subtask2_07.txt AC 28 ms 123136 KB
subtask2_08.txt AC 27 ms 119040 KB
subtask2_09.txt AC 70 ms 243968 KB
subtask2_10.txt AC 55 ms 246016 KB
subtask2_11.txt AC 38 ms 155904 KB
subtask2_12.txt AC 54 ms 243968 KB
subtask2_13.txt AC 46 ms 217472 KB
subtask2_14.txt AC 41 ms 190720 KB
subtask2_15.txt AC 19 ms 92416 KB
subtask2_16.txt AC 31 ms 137472 KB
subtask2_17.txt AC 39 ms 162048 KB
subtask2_18.txt AC 43 ms 182528 KB
subtask2_19.txt AC 38 ms 157952 KB
subtask2_20.txt AC 47 ms 203008 KB
subtask2_21.txt AC 47 ms 203008 KB
subtask2_22.txt AC 49 ms 217344 KB
subtask2_23.txt AC 51 ms 227584 KB
subtask2_24.txt AC 59 ms 254208 KB
subtask2_25.txt AC 53 ms 233728 KB
subtask3_01.txt RE 111 ms 256 KB
subtask3_02.txt RE 97 ms 256 KB
subtask3_03.txt RE 98 ms 256 KB
subtask3_04.txt RE 99 ms 256 KB
subtask3_05.txt RE 98 ms 256 KB
subtask3_06.txt RE 96 ms 256 KB
subtask3_07.txt RE 97 ms 256 KB
subtask3_08.txt RE 96 ms 256 KB
subtask3_09.txt RE 97 ms 256 KB
subtask3_10.txt RE 96 ms 256 KB
subtask3_11.txt RE 97 ms 256 KB
subtask3_12.txt RE 96 ms 256 KB
subtask3_13.txt RE 98 ms 256 KB
subtask3_14.txt RE 96 ms 256 KB
subtask3_15.txt RE 96 ms 256 KB
subtask3_16.txt RE 96 ms 256 KB
subtask3_17.txt RE 96 ms 256 KB
subtask3_18.txt RE 97 ms 256 KB
subtask3_19.txt RE 97 ms 256 KB
subtask3_20.txt RE 96 ms 256 KB
subtask3_21.txt RE 96 ms 256 KB
subtask3_22.txt RE 96 ms 256 KB
subtask3_23.txt RE 97 ms 256 KB
subtask3_24.txt RE 96 ms 256 KB
subtask3_25.txt RE 96 ms 256 KB