Submission #1695136
Source Code Expand
#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<iostream> #include<algorithm> using namespace std; #define REP(i,st,ed) for(register int i=st,i##end=ed;i<=i##end;++i) #define DREP(i,st,ed) for(register int i=st,i##end=ed;i>=i##end;--i) typedef long long ll; const int maxn=3000+10; inline int read(){ int x; char c; int f=1; while((c=getchar())!='-' && (c<'0' || c>'9')); if(c=='-') c=getchar(),f=-1; x=c^'0'; while((c=getchar())>='0' && c<='9') x=(x<<1)+(x<<3)+(c^'0'); return x*f; } inline ll readll(){ ll x; char c; ll f=1; while((c=getchar())!='-' && (c<'0' || c>'9')); if(c=='-') c=getchar(),f=-1; x=c^'0'; while((c=getchar())>='0' && c<='9') x=(x<<1ll)+(x<<3ll)+(c^'0'); return x*f; } const int mod=1e9+7; int dp[maxn][maxn][2]; int main(){ int n=read(),m=read(); dp[0][0][1]=1; REP(i,1,n) dp[0][i][0]=1; REP(i,1,m) REP(j,0,n) REP(k,0,1){ if(j){ dp[i][j][k]=(dp[i][j][k]+dp[i-1][j-1][k])%mod; dp[i][j][k|(j==1)]=(dp[i][j][k|(j==1)]+dp[i-1][j][k])%mod; } if(j<n){ dp[i][j][k|(j==0)]=(dp[i][j][k|(j==0)]+dp[i-1][j+1][k])%mod; dp[i][j][k]=(dp[i][j][k]+dp[i-1][j][k])%mod; } } int ans=0; REP(i,0,n) ans=(ans+dp[m][i][1])%mod; printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Piling Up |
User | zhou888 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1310 Byte |
Status | AC |
Exec Time | 252 ms |
Memory | 70784 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 | 2 ms | 384 KB |
sample_03.txt | AC | 96 ms | 69376 KB |
subtask_1_01.txt | AC | 43 ms | 14592 KB |
subtask_1_02.txt | AC | 21 ms | 27520 KB |
subtask_1_03.txt | AC | 78 ms | 69120 KB |
subtask_1_04.txt | AC | 72 ms | 38400 KB |
subtask_1_05.txt | AC | 182 ms | 61696 KB |
subtask_1_06.txt | AC | 78 ms | 69120 KB |
subtask_1_07.txt | AC | 88 ms | 64768 KB |
subtask_1_08.txt | AC | 34 ms | 45952 KB |
subtask_1_09.txt | AC | 169 ms | 70272 KB |
subtask_1_10.txt | AC | 252 ms | 70784 KB |
subtask_1_11.txt | AC | 78 ms | 64640 KB |
subtask_1_12.txt | AC | 52 ms | 40064 KB |
subtask_1_13.txt | AC | 71 ms | 68992 KB |
subtask_1_14.txt | AC | 38 ms | 60160 KB |
subtask_1_15.txt | AC | 27 ms | 21632 KB |
subtask_1_16.txt | AC | 91 ms | 69248 KB |
subtask_1_17.txt | AC | 32 ms | 33792 KB |
subtask_1_18.txt | AC | 41 ms | 29952 KB |
subtask_1_19.txt | AC | 45 ms | 68736 KB |
subtask_1_20.txt | AC | 96 ms | 69376 KB |
subtask_1_21.txt | AC | 8 ms | 27264 KB |
subtask_1_22.txt | AC | 17 ms | 68352 KB |
subtask_1_23.txt | AC | 10 ms | 35456 KB |
subtask_1_24.txt | AC | 17 ms | 68352 KB |
subtask_1_25.txt | AC | 1 ms | 384 KB |
subtask_1_26.txt | AC | 18 ms | 68352 KB |
subtask_1_27.txt | AC | 1 ms | 256 KB |