Submission #1845841
Source Code Expand
#include <bits/stdc++.h> const int N=3050,mo=1e9+7; using namespace std; inline int gi(){ char ch=getchar();int x=0,q=0; while(ch<'0' || ch>'9') ch=='-'?q=1:0,ch=getchar(); while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar(); return q?(-x):x; } int f[N][N][2]; void dp(int &x,int y){ x+=y; if (x>=mo) x-=mo; return; } int main(){ int n=gi(),m=gi(); for (int i=0; i<=m; ++i) f[0][i][i==0]=1; for (int i=0; i<m; ++i) for (int j=0; j<=n; ++j) for (int k=0; k<=1; ++k) if (f[i][j][k]){ if (j) dp(f[i+1][j-1][k|(j==1)],f[i][j][k]); if (j) dp(f[i+1][j][k|(j==1)],f[i][j][k]); if (j<n) dp(f[i+1][j+1][k],f[i][j][k]); if (j<n) dp(f[i+1][j][k],f[i][j][k]); } int ans=0; for (int i=0; i<=n; ++i) dp(ans,f[m][i][1]); cout<<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Piling Up |
User | Thefinal |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 823 Byte |
Status | AC |
Exec Time | 188 ms |
Memory | 71936 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 | 90 ms | 70912 KB |
subtask_1_01.txt | AC | 15 ms | 13312 KB |
subtask_1_02.txt | AC | 19 ms | 27520 KB |
subtask_1_03.txt | AC | 74 ms | 70784 KB |
subtask_1_04.txt | AC | 56 ms | 38400 KB |
subtask_1_05.txt | AC | 137 ms | 61696 KB |
subtask_1_06.txt | AC | 74 ms | 70784 KB |
subtask_1_07.txt | AC | 82 ms | 66816 KB |
subtask_1_08.txt | AC | 31 ms | 45952 KB |
subtask_1_09.txt | AC | 144 ms | 71552 KB |
subtask_1_10.txt | AC | 188 ms | 71936 KB |
subtask_1_11.txt | AC | 72 ms | 64640 KB |
subtask_1_12.txt | AC | 46 ms | 42112 KB |
subtask_1_13.txt | AC | 67 ms | 70656 KB |
subtask_1_14.txt | AC | 36 ms | 60288 KB |
subtask_1_15.txt | AC | 21 ms | 21632 KB |
subtask_1_16.txt | AC | 86 ms | 70912 KB |
subtask_1_17.txt | AC | 29 ms | 33792 KB |
subtask_1_18.txt | AC | 33 ms | 29952 KB |
subtask_1_19.txt | AC | 43 ms | 70528 KB |
subtask_1_20.txt | AC | 89 ms | 70912 KB |
subtask_1_21.txt | AC | 7 ms | 29312 KB |
subtask_1_22.txt | AC | 15 ms | 70272 KB |
subtask_1_23.txt | AC | 8 ms | 35456 KB |
subtask_1_24.txt | AC | 15 ms | 70272 KB |
subtask_1_25.txt | AC | 1 ms | 384 KB |
subtask_1_26.txt | AC | 15 ms | 70272 KB |
subtask_1_27.txt | AC | 1 ms | 256 KB |