Submission #1319188
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cstdio> #include<cmath> #include<cstdlib> #include<ctime> #include<queue> #include<set> using namespace std; typedef long long LL; const int N=3010; int gi() { int w=0;bool q=1;char c=getchar(); while ((c<'0'||c>'9') && c!='-') c=getchar(); if (c=='-') q=0,c=getchar(); while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar(); return q? w:-w; } int f[N][2],g[N][2]; const int mod=1e9+7; inline void inc(int &x,int y) { (x+=y)<mod?0:x-=mod; } int main() { int n=gi(),m=gi(),i,j,ans=0; for (i=0;i<=n;i++) f[i][!i]=1; while (m--) { for (i=0;i<=n;i++) for (j=0;j<2;j++) if (f[i][j]) { if (i) { inc(g[i-1][ j | !(i-1) ],f[i][j]); inc(g[i][ j | !(i-1) ],f[i][j]); } if (i<n) { inc(g[i+1][j],f[i][j]); inc(g[i][j],f[i][j]); } } for (i=0;i<=n;i++) f[i][0]=g[i][0],f[i][1]=g[i][1],g[i][0]=g[i][1]=0; } for (i=0;i<=n;i++) inc(ans,f[i][1]); printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Piling Up |
User | laofu |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1051 Byte |
Status | AC |
Exec Time | 187 ms |
Memory | 256 KB |
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 | 256 KB |
sample_03.txt | AC | 77 ms | 256 KB |
subtask_1_01.txt | AC | 18 ms | 256 KB |
subtask_1_02.txt | AC | 14 ms | 256 KB |
subtask_1_03.txt | AC | 61 ms | 256 KB |
subtask_1_04.txt | AC | 50 ms | 256 KB |
subtask_1_05.txt | AC | 133 ms | 256 KB |
subtask_1_06.txt | AC | 61 ms | 256 KB |
subtask_1_07.txt | AC | 70 ms | 256 KB |
subtask_1_08.txt | AC | 23 ms | 256 KB |
subtask_1_09.txt | AC | 133 ms | 256 KB |
subtask_1_10.txt | AC | 187 ms | 256 KB |
subtask_1_11.txt | AC | 61 ms | 256 KB |
subtask_1_12.txt | AC | 39 ms | 256 KB |
subtask_1_13.txt | AC | 54 ms | 256 KB |
subtask_1_14.txt | AC | 25 ms | 256 KB |
subtask_1_15.txt | AC | 17 ms | 256 KB |
subtask_1_16.txt | AC | 73 ms | 256 KB |
subtask_1_17.txt | AC | 23 ms | 256 KB |
subtask_1_18.txt | AC | 28 ms | 256 KB |
subtask_1_19.txt | AC | 30 ms | 256 KB |
subtask_1_20.txt | AC | 77 ms | 256 KB |
subtask_1_21.txt | AC | 1 ms | 256 KB |
subtask_1_22.txt | AC | 1 ms | 256 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 1 ms | 256 KB |
subtask_1_25.txt | AC | 1 ms | 256 KB |
subtask_1_26.txt | AC | 1 ms | 256 KB |
subtask_1_27.txt | AC | 1 ms | 256 KB |