Submission #6384104

---

Source Code Expand

#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

int Solve1(int n, int k, int m) { // nie ma k + 1 kolejnych
  VVI dp(n + 2, VI(n + 2));
  dp[0][0] = 1;
  RE (i, n) {
    REP (prv, k + 1) {
      dp[i][0] = (dp[i][0] + dp[i - 1][prv]) % m;
      if (prv < k) {
        dp[i][prv + 1] = (dp[i][prv + 1] + dp[i - 1][prv]) % m;
      }
    }
  }
  int res = 0;
  REP (prv, k + 1) {
    res = (res + dp[n][prv]) % m;
  }
  return res;
}

const int N = 80;
int dp[2 * N][N][N][N];
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int n, k, m;
  cin>>n>>k>>m;
  if (k % 2 == 0) {
    cout<<Solve1(n / 2, k / 2, m) * Solve1(n - n / 2, k / 2, m) % m<<endl;
    return 0;
  }
  if (k == 1) {
    cout<<Solve1(n, 2, m)<<endl;
    return 0;
  }
  dp[0][0][0][N - 1] = 1;
  // dp[a][b][c][d] 
  // pozycja a
  // na parzystosci a dlugosc b
  // na parzystosci a-1 dlugosc c
  // dluzszy z nich nie moze dojsc do dlugosci d
  RE (i, n) {
    REP (prv_b, N - 2) {
      REP (prv_c, N - 2) {
        REP (prv_d, N) {
          // dodajemy x
          int nb = prv_c + 1;
          int nc = prv_b;
          int nd = prv_d;
          if (nb > nc && nc >= 1 && nb * 2 >= k + 3) {
            mini(nd, nb + (k - 2 * nc + 1) / 2);
            maxi(nd, 0ll);
          }
          if (i >= 5 && prv_b == 2 && prv_c == 2 && prv_d == N - 1) {
            debug(nb, nc, nd);
          }
          dp[i][nb][nc][nd] = (dp[i][nb][nc][nd] + dp[i - 1][prv_b][prv_c][prv_d]) % m;
          if (i >= 5 && prv_b == 2 && prv_c == 2 && prv_d == N - 1) {
            debug(dp[i][nb][nc][nd]);
          }
          if (nb >= nd || nc >= nd) {
            if (dp[i - 1][prv_b][prv_c][prv_d]) {
              debug(i, nb, nc, nd, prv_b, prv_c, prv_d, dp[i][nb][nc][nd], dp[i - 1][prv_b][prv_c][prv_d]);
            }
            dp[i][nb][nc][nd] = 0;
          }
          if (i >= 5 && prv_b == 2 && prv_c == 2 && prv_d == N - 1) {
            debug(dp[i][nb][nc][nd]);
          }
          // dodajemy o
          nb = 0;
          nc = prv_b;
          if (prv_c >= prv_b) {
            nd = N - 1;
          }
          dp[i][nb][nc][nd] = (dp[i][nb][nc][nd] + dp[i - 1][prv_b][prv_c][prv_d]) % m;
          if (nb >= nd || nc >= nd) {
            dp[i][nb][nc][nd] = 0;
          }
        }
      }
    }
  }
  int res = 0;
  REP (prv_b, N - 1) {
    REP (prv_c, N - 1) {
      REP (prv_d, N) {
        res = (res + dp[n][prv_b][prv_c][prv_d]) % m;
      }
    }
  }
  cout<<res<<endl;
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}

Submission Info

Judge Result