Submission #1814248
Source Code Expand
#include<cstdio>
const int MOD=1e9+7;
struct mint{int x;mint(int x=0):x(x){}};
inline mint operator+ (mint a,mint b){return a.x+b.x<MOD?a.x+b.x:a.x+b.x-MOD;}
inline mint operator- (mint a){return MOD-a.x;}
inline mint operator- (mint a,mint b){return a+-b;}
inline mint operator* (mint a,mint b){return 1LL*a.x*b.x%MOD;}
inline mint operator<< (mint x,int y){mint r=1;for(;y;y>>=1,x=x*x)if(y&1)r=r*x;return r;}
inline mint operator~ (mint x){return x<<MOD-2;}
inline mint operator/ (mint a,mint b){return a*~b;}
inline mint&operator+= (mint&a,mint b){return a=a+b;}
inline mint&operator-= (mint&a,mint b){return a=a-b;}
inline mint&operator*= (mint&a,mint b){return a=a*b;}
inline mint&operator<<=(mint&x,int y){return x=x<<y;}
inline mint&operator/= (mint&a,mint b){return a=a/b;}
#define MN 3000
mint f[MN+5][MN+5],ff[MN+5][MN+5],ans;
int main()
{
int n,m,i,j;
scanf("%d%d",&n,&m);--m;
for(i=1;i<=n;++i)f[0][i]=1;
for(i=1;i<n;++i)ff[0][i]=1;
for(i=0;i<m;++i)for(j=1;j<=n;++j)
{
f[i+1][j]+=f[i][j]+f[i][j];
f[i+1][j-1]+=f[i][j];
if(j<n)f[i+1][j+1]+=f[i][j];
ff[i+1][j]+=ff[i][j]+ff[i][j];
ff[i+1][j-1]+=ff[i][j];
if(j+1<n)ff[i+1][j+1]+=ff[i][j];
}
for(i=1;i<=n;++i)ans+=f[m][i]-ff[m][i];
printf("%d",4*ans);
}
Submission Info
Submission Time
2017-11-28 17:43:21+0900
Task
D - Piling Up
User
ditoly
Language
C++14 (GCC 5.4.1)
Score
900
Code Size
1275 Byte
Status
AC
Exec Time
85 ms
Memory
70656 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:36:19: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘mint’ [-Wformat=]
printf("%d",4*ans);
^
./Main.cpp:23:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);--m;
^
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
21 ms
70656 KB
sample_02.txt
AC
22 ms
70656 KB
sample_03.txt
AC
43 ms
70656 KB
subtask_1_01.txt
AC
32 ms
70656 KB
subtask_1_02.txt
AC
25 ms
70656 KB
subtask_1_03.txt
AC
39 ms
70656 KB
subtask_1_04.txt
AC
39 ms
70656 KB
subtask_1_05.txt
AC
67 ms
70656 KB
subtask_1_06.txt
AC
39 ms
70656 KB
subtask_1_07.txt
AC
41 ms
70656 KB
subtask_1_08.txt
AC
28 ms
70656 KB
subtask_1_09.txt
AC
63 ms
70656 KB
subtask_1_10.txt
AC
85 ms
70656 KB
subtask_1_11.txt
AC
39 ms
70656 KB
subtask_1_12.txt
AC
33 ms
70656 KB
subtask_1_13.txt
AC
37 ms
70656 KB
subtask_1_14.txt
AC
28 ms
70656 KB
subtask_1_15.txt
AC
27 ms
70656 KB
subtask_1_16.txt
AC
42 ms
70656 KB
subtask_1_17.txt
AC
28 ms
70656 KB
subtask_1_18.txt
AC
31 ms
70656 KB
subtask_1_19.txt
AC
29 ms
70656 KB
subtask_1_20.txt
AC
43 ms
70656 KB
subtask_1_21.txt
AC
22 ms
70656 KB
subtask_1_22.txt
AC
22 ms
70656 KB
subtask_1_23.txt
AC
22 ms
70656 KB
subtask_1_24.txt
AC
22 ms
70656 KB
subtask_1_25.txt
AC
22 ms
70656 KB
subtask_1_26.txt
AC
22 ms
70656 KB
subtask_1_27.txt
AC
21 ms
70656 KB