Submission #1354176
Source Code Expand
#include<bits/stdc++.h> const int p=1e9+7; void up(int &a,int b){(a+=b)>=p&&(a-=p);} int f[3001][3002][2],n,m,ans; int main() { scanf("%d%d",&n,&m),f[0][0][1]=1; for(int i=1;i<=n;++i)f[0][i][0]=1; for(int i=0;i<m;++i) { up(f[i+1][1][1],f[i][0][1]); up(f[i+1][1][1],f[i][1][0]); up(f[i+1][2][0],f[i][1][0]); up(f[i+1][1][1],f[i][1][1]); up(f[i+1][2][1],f[i][1][1]); for(int j=2;j<=n;++j) for(int k=0;k<2;++k) { up(f[i+1][j][k],f[i][j][k]); up(f[i+1][j+1][k],f[i][j][k]); } for(int j=1;j<=n;++j) for(int k=0;k<2;++k) up(f[i+1][j-1][k],f[i+1][j][k]); } for(int i=0;i<=n;++i)up(ans,f[m][i][1]); printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Piling Up |
User | zrnlkc |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 735 Byte |
Status | AC |
Exec Time | 128 ms |
Memory | 70656 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:10:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&m),f[0][0][1]=1; ^
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 | 256 KB |
sample_02.txt | AC | 1 ms | 384 KB |
sample_03.txt | AC | 61 ms | 69248 KB |
subtask_1_01.txt | AC | 14 ms | 14592 KB |
subtask_1_02.txt | AC | 14 ms | 27520 KB |
subtask_1_03.txt | AC | 51 ms | 68992 KB |
subtask_1_04.txt | AC | 40 ms | 38400 KB |
subtask_1_05.txt | AC | 94 ms | 61696 KB |
subtask_1_06.txt | AC | 51 ms | 68992 KB |
subtask_1_07.txt | AC | 56 ms | 64768 KB |
subtask_1_08.txt | AC | 23 ms | 45952 KB |
subtask_1_09.txt | AC | 97 ms | 70144 KB |
subtask_1_10.txt | AC | 128 ms | 70656 KB |
subtask_1_11.txt | AC | 50 ms | 64640 KB |
subtask_1_12.txt | AC | 32 ms | 40192 KB |
subtask_1_13.txt | AC | 47 ms | 68992 KB |
subtask_1_14.txt | AC | 27 ms | 60160 KB |
subtask_1_15.txt | AC | 16 ms | 21632 KB |
subtask_1_16.txt | AC | 59 ms | 69120 KB |
subtask_1_17.txt | AC | 21 ms | 33792 KB |
subtask_1_18.txt | AC | 24 ms | 29952 KB |
subtask_1_19.txt | AC | 32 ms | 68608 KB |
subtask_1_20.txt | AC | 61 ms | 69248 KB |
subtask_1_21.txt | AC | 7 ms | 27264 KB |
subtask_1_22.txt | AC | 15 ms | 68352 KB |
subtask_1_23.txt | AC | 8 ms | 35456 KB |
subtask_1_24.txt | AC | 15 ms | 68352 KB |
subtask_1_25.txt | AC | 1 ms | 384 KB |
subtask_1_26.txt | AC | 15 ms | 68352 KB |
subtask_1_27.txt | AC | 1 ms | 256 KB |