Submission #3820103
Source Code Expand
#include <cstdio>
#define rep(i,j,k) for (i=j;i<=k;i++)
using namespace std;
const int N=3e3+5,mod=1e9+7;
int n,m,i,j,p,ans,f[N][N][2];
void updata(int &x,int y) { x+=y; if (x>=mod) x-=mod; }
int main()
{
// freopen("piling.in","r",stdin);
// freopen("piling.out","w",stdout);
scanf("%d%d",&n,&m);
f[0][0][1]=1;
rep(i,1,n) f[0][i][0]=1;
rep(i,0,m-1)
rep(j,0,n)
rep(p,0,1)
if (f[i][j][p])
{
if (j) updata(f[i+1][j-1][p|(j==1)],f[i][j][p]);
if (j) updata(f[i+1][j][p|(j==1)],f[i][j][p]);
if (n-j) updata(f[i+1][j][p],f[i][j][p]);
if (n-j) updata(f[i+1][j+1][p],f[i][j][p]);
}
rep(i,0,n)
updata(ans,f[m][i][1]);
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2018-12-18 22:29:31+0900
Task
D - Piling Up
User
Bubble
Language
C++14 (GCC 5.4.1)
Score
900
Code Size
706 Byte
Status
AC
Exec Time
195 ms
Memory
70656 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:11: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
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
128 KB
sample_02.txt
AC
1 ms
256 KB
sample_03.txt
AC
92 ms
69248 KB
subtask_1_01.txt
AC
19 ms
14464 KB
subtask_1_02.txt
AC
19 ms
27392 KB
subtask_1_03.txt
AC
75 ms
68992 KB
subtask_1_04.txt
AC
58 ms
38400 KB
subtask_1_05.txt
AC
142 ms
61568 KB
subtask_1_06.txt
AC
76 ms
68992 KB
subtask_1_07.txt
AC
83 ms
64640 KB
subtask_1_08.txt
AC
32 ms
45824 KB
subtask_1_09.txt
AC
148 ms
70144 KB
subtask_1_10.txt
AC
195 ms
70656 KB
subtask_1_11.txt
AC
74 ms
64640 KB
subtask_1_12.txt
AC
47 ms
40064 KB
subtask_1_13.txt
AC
69 ms
68864 KB
subtask_1_14.txt
AC
37 ms
60160 KB
subtask_1_15.txt
AC
21 ms
21632 KB
subtask_1_16.txt
AC
88 ms
69120 KB
subtask_1_17.txt
AC
29 ms
33664 KB
subtask_1_18.txt
AC
33 ms
29824 KB
subtask_1_19.txt
AC
44 ms
68608 KB
subtask_1_20.txt
AC
92 ms
69248 KB
subtask_1_21.txt
AC
6 ms
27136 KB
subtask_1_22.txt
AC
14 ms
68224 KB
subtask_1_23.txt
AC
8 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
1 ms
128 KB