Submission #1868951


Source Code Expand

#include <cstdio>
const int mo=1000000007;
int f[3005][3005][2];
int main(){
	int n,m;
	scanf("%d%d\n",&n,&m);
	for (int i=0;i<=n;i++) f[0][i][i==0]=1;
	for (int i=0;i<m;i++)
		for (int j=0;j<=n;j++)
			for (int k=0;k<2;k++)
			if (f[i][j][k]){
				int x=f[i][j][k];
				if (j) (f[i+1][j-1][k||j==1]+=x)%=mo,(f[i+1][j][k||j==1]+=x)%=mo;
				if (j<n) (f[i+1][j][k]+=x)%=mo,(f[i+1][j+1][k]+=x)%=mo;
			}
	int ans=0;
	for (int i=0;i<=n;i++) (ans+=f[m][i][1])%=mo;
	printf("%d\n",ans);
}

Submission Info

Submission Time
Task D - Piling Up
User aufeas
Language C++14 (GCC 5.4.1)
Score 900
Code Size 501 Byte
Status AC
Exec Time 165 ms
Memory 70656 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d\n",&n,&m);
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 33
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt
Case Name Status Exec Time Memory
sample_01.txt AC 0 ms 128 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 73 ms 69120 KB
subtask_1_01.txt AC 24 ms 14464 KB
subtask_1_02.txt AC 16 ms 27392 KB
subtask_1_03.txt AC 60 ms 68992 KB
subtask_1_04.txt AC 49 ms 38400 KB
subtask_1_05.txt AC 120 ms 61568 KB
subtask_1_06.txt AC 60 ms 68992 KB
subtask_1_07.txt AC 66 ms 64640 KB
subtask_1_08.txt AC 25 ms 45824 KB
subtask_1_09.txt AC 120 ms 70144 KB
subtask_1_10.txt AC 165 ms 70656 KB
subtask_1_11.txt AC 59 ms 64512 KB
subtask_1_12.txt AC 38 ms 40064 KB
subtask_1_13.txt AC 55 ms 68864 KB
subtask_1_14.txt AC 30 ms 60160 KB
subtask_1_15.txt AC 18 ms 21632 KB
subtask_1_16.txt AC 69 ms 69120 KB
subtask_1_17.txt AC 24 ms 33664 KB
subtask_1_18.txt AC 28 ms 29824 KB
subtask_1_19.txt AC 36 ms 68608 KB
subtask_1_20.txt AC 73 ms 69120 KB
subtask_1_21.txt AC 6 ms 27136 KB
subtask_1_22.txt AC 13 ms 68224 KB
subtask_1_23.txt AC 7 ms 35328 KB
subtask_1_24.txt AC 14 ms 68224 KB
subtask_1_25.txt AC 1 ms 256 KB
subtask_1_26.txt AC 14 ms 68224 KB
subtask_1_27.txt AC 0 ms 128 KB