Submission #1845535


Source Code Expand

#include<cstdio>
using namespace std;
const int N=3030,P=1000000007;
int i,j,k,n,m,L,R,t,ans;
int f[2][2][N];
void Up(int &x,int y) {
	x=(x+y)%P;
}
int main() {
	scanf("%d%d",&n,&m);
	L=1;R=0;
	for (i=1;i<=n;i++) f[R][0][i]=1;
	f[R][1][0]=1;
	for (i=1;i<=m;i++) {
		L^=1;R^=1;
		for (j=0;j<=n;j++) {
			if (f[L][0][j]) {
				t=f[L][0][j];
				if (j<n) Up(f[R][0][j+1],t),Up(f[R][0][j],t);
				if (j>1) Up(f[R][0][j-1],t),Up(f[R][0][j],t);
				if (j==1) Up(f[R][1][0],t),Up(f[R][1][1],t);
				f[L][0][j]=0;
			}
			if (f[L][1][j]) {
				t=f[L][1][j];
				if (j<n) Up(f[R][1][j+1],t),Up(f[R][1][j],t);
				if (j>0) Up(f[R][1][j-1],t),Up(f[R][1][j],t);
				f[L][1][j]=0;
			}
		}
	}
	for (i=0;i<=n;i++) Up(ans,f[R][1][i]);
	printf("%d\n",ans);
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10: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 0 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 41 ms 128 KB
subtask_1_01.txt AC 13 ms 256 KB
subtask_1_02.txt AC 7 ms 128 KB
subtask_1_03.txt AC 32 ms 128 KB
subtask_1_04.txt AC 28 ms 256 KB
subtask_1_05.txt AC 73 ms 256 KB
subtask_1_06.txt AC 32 ms 128 KB
subtask_1_07.txt AC 37 ms 128 KB
subtask_1_08.txt AC 12 ms 128 KB
subtask_1_09.txt AC 72 ms 256 KB
subtask_1_10.txt AC 101 ms 256 KB
subtask_1_11.txt AC 32 ms 128 KB
subtask_1_12.txt AC 21 ms 128 KB
subtask_1_13.txt AC 29 ms 128 KB
subtask_1_14.txt AC 13 ms 128 KB
subtask_1_15.txt AC 10 ms 128 KB
subtask_1_16.txt AC 39 ms 128 KB
subtask_1_17.txt AC 12 ms 128 KB
subtask_1_18.txt AC 15 ms 128 KB
subtask_1_19.txt AC 16 ms 128 KB
subtask_1_20.txt AC 41 ms 256 KB
subtask_1_21.txt AC 0 ms 128 KB
subtask_1_22.txt AC 1 ms 128 KB
subtask_1_23.txt AC 1 ms 128 KB
subtask_1_24.txt AC 1 ms 128 KB
subtask_1_25.txt AC 0 ms 128 KB
subtask_1_26.txt AC 1 ms 128 KB
subtask_1_27.txt AC 0 ms 128 KB