Submission #1695446
Source Code Expand
#include<stdio.h> #include<cctype> #include<algorithm> using namespace std; #define Maxn 3009 int read() { int x=0;char ch=getchar(); while(!isdigit(ch)) ch=getchar(); while(isdigit(ch)) { x=x*10+ch-48; ch=getchar(); } return x; } int n,m,p,ans,f[Maxn][Maxn][2]; int main(){ n=read();m=read();p=(int)(1e9+7); f[0][0][1]=1; for(int i=1;i<=n;++i) f[0][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(j) { (f[i+1][j-1][k|(j==1)]+=f[i][j][k])%=p; (f[i+1][j][k|(j==1)]+=f[i][j][k])%=p; } if(n-j) { (f[i+1][j][k]+=f[i][j][k])%=p; (f[i+1][j+1][k]+=f[i][j][k])%=p; } } int ans=0; for(int i=0;i<=n;++i) (ans+=f[m][i][1])%=p; printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Piling Up |
User | qrsikno |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 778 Byte |
Status | AC |
Exec Time | 193 ms |
Memory | 70656 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 | 128 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 74 ms | 69248 KB |
subtask_1_01.txt | AC | 33 ms | 14464 KB |
subtask_1_02.txt | AC | 16 ms | 27392 KB |
subtask_1_03.txt | AC | 60 ms | 68992 KB |
subtask_1_04.txt | AC | 55 ms | 38400 KB |
subtask_1_05.txt | AC | 139 ms | 61568 KB |
subtask_1_06.txt | AC | 60 ms | 68992 KB |
subtask_1_07.txt | AC | 67 ms | 64640 KB |
subtask_1_08.txt | AC | 26 ms | 45824 KB |
subtask_1_09.txt | AC | 129 ms | 70144 KB |
subtask_1_10.txt | AC | 193 ms | 70656 KB |
subtask_1_11.txt | AC | 60 ms | 64512 KB |
subtask_1_12.txt | AC | 40 ms | 40064 KB |
subtask_1_13.txt | AC | 55 ms | 68864 KB |
subtask_1_14.txt | AC | 30 ms | 60160 KB |
subtask_1_15.txt | AC | 21 ms | 21632 KB |
subtask_1_16.txt | AC | 70 ms | 69120 KB |
subtask_1_17.txt | AC | 24 ms | 33664 KB |
subtask_1_18.txt | AC | 31 ms | 29824 KB |
subtask_1_19.txt | AC | 35 ms | 68608 KB |
subtask_1_20.txt | AC | 74 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 | 7 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 |