Submission #1868368
Source Code Expand
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
/*******************************head*******************************/
const int maxn=3005;
const int mod=1e9+7;
inline void add(int &x,int y){
x=((x+y)>=mod?(x+y-mod):(x+y));
}
int n,m,f[maxn][maxn][2];
int main(){
read(n);read(m);
rep(i,0,m)f[0][i][i==0]=1;
rep(i,0,m-1)rep(j,0,n)rep(k,0,1)if(f[i][j][k]){
int res=f[i][j][k];
if(j)add(f[i+1][j-1][k|(j==1)],res);
if(j)add(f[i+1][j][k|(j==1)],res);
if (j<n)add(f[i+1][j+1][k],res);
if (j<n)add(f[i+1][j][k],res);
}
int ans=0;
rep(i,0,n)add(ans,f[m][i][1]);
cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Piling Up |
User |
Scape |
Language |
C++14 (GCC 5.4.1) |
Score |
900 |
Code Size |
1410 Byte |
Status |
AC |
Exec Time |
120 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 |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
58 ms |
69248 KB |
subtask_1_01.txt |
AC |
13 ms |
13312 KB |
subtask_1_02.txt |
AC |
15 ms |
27520 KB |
subtask_1_03.txt |
AC |
49 ms |
69120 KB |
subtask_1_04.txt |
AC |
38 ms |
38400 KB |
subtask_1_05.txt |
AC |
89 ms |
61696 KB |
subtask_1_06.txt |
AC |
49 ms |
69120 KB |
subtask_1_07.txt |
AC |
53 ms |
64768 KB |
subtask_1_08.txt |
AC |
23 ms |
45952 KB |
subtask_1_09.txt |
AC |
89 ms |
70144 KB |
subtask_1_10.txt |
AC |
120 ms |
70656 KB |
subtask_1_11.txt |
AC |
48 ms |
64640 KB |
subtask_1_12.txt |
AC |
31 ms |
40192 KB |
subtask_1_13.txt |
AC |
46 ms |
68992 KB |
subtask_1_14.txt |
AC |
28 ms |
60288 KB |
subtask_1_15.txt |
AC |
15 ms |
21632 KB |
subtask_1_16.txt |
AC |
55 ms |
69248 KB |
subtask_1_17.txt |
AC |
21 ms |
33792 KB |
subtask_1_18.txt |
AC |
24 ms |
29952 KB |
subtask_1_19.txt |
AC |
33 ms |
68736 KB |
subtask_1_20.txt |
AC |
57 ms |
69248 KB |
subtask_1_21.txt |
AC |
8 ms |
27264 KB |
subtask_1_22.txt |
AC |
18 ms |
68352 KB |
subtask_1_23.txt |
AC |
10 ms |
35456 KB |
subtask_1_24.txt |
AC |
18 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 |