Submission #2532263


Source Code Expand

#include<cstdio>
#include<cstring>
using namespace std;
const int N=3005,mod=1e9+7;
int f[2][N][2],n,m,ans;
inline void inc(int &x,int y)
{
	x+=y; x-=x>=mod?mod:0;
}
int main()
{
	register int i,j,k;
	scanf("%d%d",&n,&m);
	for (i=1;i<=n;++i)
	f[0][i][0]=1; f[0][0][1]=1;
	for (i=0;i<m;++i)
	{
		int now=i&1,nxt=now^1;
		memset(f[nxt],0,sizeof(f[nxt]));
		for (j=0;j<=n;++j)
		for (k=0;k<=1;++k)
		{
			if (j) inc(f[nxt][j-1][k|(j==1)],f[now][j][k]);
			if (j) inc(f[nxt][j][k|(j==1)],f[now][j][k]);
			if (n-j) inc(f[nxt][j+1][k],f[now][j][k]);
			if (n-j) inc(f[nxt][j][k],f[now][j][k]);
		}
	}
	for (i=0;i<=n;++i)
	inc(ans,f[m&1][i][1]);
	printf("%d",ans);
	return 0;
}

Submission Info

Submission Time
Task D - Piling Up
User hl666
Language C++14 (GCC 5.4.1)
Score 900
Code Size 703 Byte
Status AC
Exec Time 115 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 40 ms 256 KB
subtask_1_01.txt AC 19 ms 256 KB
subtask_1_02.txt AC 8 ms 256 KB
subtask_1_03.txt AC 32 ms 256 KB
subtask_1_04.txt AC 31 ms 256 KB
subtask_1_05.txt AC 82 ms 256 KB
subtask_1_06.txt AC 32 ms 256 KB
subtask_1_07.txt AC 37 ms 256 KB
subtask_1_08.txt AC 12 ms 256 KB
subtask_1_09.txt AC 75 ms 256 KB
subtask_1_10.txt AC 115 ms 256 KB
subtask_1_11.txt AC 32 ms 256 KB
subtask_1_12.txt AC 22 ms 256 KB
subtask_1_13.txt AC 28 ms 256 KB
subtask_1_14.txt AC 13 ms 256 KB
subtask_1_15.txt AC 11 ms 256 KB
subtask_1_16.txt AC 38 ms 256 KB
subtask_1_17.txt AC 12 ms 256 KB
subtask_1_18.txt AC 17 ms 256 KB
subtask_1_19.txt AC 16 ms 256 KB
subtask_1_20.txt AC 40 ms 256 KB
subtask_1_21.txt AC 1 ms 256 KB
subtask_1_22.txt AC 3 ms 256 KB
subtask_1_23.txt AC 2 ms 256 KB
subtask_1_24.txt AC 3 ms 256 KB
subtask_1_25.txt AC 1 ms 256 KB
subtask_1_26.txt AC 3 ms 256 KB
subtask_1_27.txt AC 0 ms 128 KB