Submission #1695427


Source Code Expand

#include<bits/stdc++.h>
const int N = 3e3 + 10;
using namespace std;

int f[N][N][2];
int n, m;
const int mod = 1e9 + 7;
inline void add(int &x,int y)
{  
   x += y; 
   if(x >= mod) x %= mod;
}

namespace solver
{
  void solve()
  {
    scanf("%d%d",&n,&m);
    for(int i=0; i<=m; ++i) f[0][i][!i]=1;
    for(int i=0; i<m; ++i)
	  for(int j=0; j<=n; ++j)
	    for(int v=0; v<2; ++v)
		{
		  int val=f[i][j][v];
		  if(j)
		  {
		    add(f[i+1][j-1][v|(j==1)], val);
			add(f[i+1][j][v|(j==1)], val);
		  }
		  if(n-j)
		  {
		    add(f[i+1][j][v], val);
			add(f[i+1][j+1][v], val);
		  }
		}
    int ans=0;
    for(int i=0; i<=n; ++i) add(ans,f[m][i][1]);
    printf("%d\n",ans);
  }
}

int main() { solver :: solve();}

Submission Info

Submission Time
Task D - Piling Up
User bestknife
Language C++14 (GCC 5.4.1)
Score 900
Code Size 762 Byte
Status AC
Exec Time 235 ms
Memory 70784 KB

Compile Error

./Main.cpp: In function ‘void solver::solve()’:
./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 33
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 108 ms 69376 KB
subtask_1_01.txt AC 26 ms 14592 KB
subtask_1_02.txt AC 23 ms 27520 KB
subtask_1_03.txt AC 89 ms 69120 KB
subtask_1_04.txt AC 71 ms 38400 KB
subtask_1_05.txt AC 172 ms 61696 KB
subtask_1_06.txt AC 90 ms 69120 KB
subtask_1_07.txt AC 99 ms 64768 KB
subtask_1_08.txt AC 39 ms 45952 KB
subtask_1_09.txt AC 175 ms 70272 KB
subtask_1_10.txt AC 235 ms 70784 KB
subtask_1_11.txt AC 88 ms 64640 KB
subtask_1_12.txt AC 57 ms 40192 KB
subtask_1_13.txt AC 82 ms 68992 KB
subtask_1_14.txt AC 45 ms 60288 KB
subtask_1_15.txt AC 27 ms 21632 KB
subtask_1_16.txt AC 104 ms 69248 KB
subtask_1_17.txt AC 36 ms 33792 KB
subtask_1_18.txt AC 41 ms 29952 KB
subtask_1_19.txt AC 54 ms 68736 KB
subtask_1_20.txt AC 108 ms 69376 KB
subtask_1_21.txt AC 9 ms 27264 KB
subtask_1_22.txt AC 21 ms 68352 KB
subtask_1_23.txt AC 12 ms 35456 KB
subtask_1_24.txt AC 21 ms 68352 KB
subtask_1_25.txt AC 1 ms 384 KB
subtask_1_26.txt AC 21 ms 68352 KB
subtask_1_27.txt AC 1 ms 256 KB