Submission #1845803

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
const int N=6050,mo=1e9+7;
using namespace std;
inline int gi(){
  char ch=getchar();int x=0,q=0;
  while(ch<'0' || ch>'9') ch=='-'?q=1:0,ch=getchar();
  while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
  return q?(-x):x;
}
ll f[N][N][2];
void dp(ll &x,ll y){
  x+=y; if (x>=mo) x-=mo;
  return;
}
int main(){
  int n=gi(),m=gi();
  for (int i=0; i<=m; ++i)
    f[0][i][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 (f[i][j][k]){
	if (j) dp(f[i+1][j-1][k|(j==1)],f[i][j][k]);
	if (j) dp(f[i+1][j][k|(j==1)],f[i][j][k]);
	if (j<n) dp(f[i+1][j+1][k],f[i][j][k]);
	if (j<n) dp(f[i+1][j][k],f[i][j][k]);
      }
  ll ans=0;
  for (int i=0; i<=n; ++i)
    dp(ans,f[m][i][1]);
  cout<<ans;
  return 0;
}

Submission Info

Judge Result