#787887 (C++14) No.2040 010-1 Deletion

提出ソース

結果

問題	No.2040 010-1 Deletion
ユーザー	👑 hos.lyric
提出日時	2022-08-12 22:02:03
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,350 ms / 3,000 ms
コード長	5,585 bytes
コンパイル時間	1,193 ms
コンパイル使用メモリ	110,256 KB
実行使用メモリ	11,912 KB
最終ジャッジ日時	2023-10-24 10:03:59
合計ジャッジ時間	20,326 ms
ジャッジサーバーID （参考情報）	judge12 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 11,912 KB
testcase_01	AC	5 ms 11,912 KB
testcase_02	AC	6 ms 11,912 KB
testcase_03	AC	12 ms 11,912 KB
testcase_04	AC	5 ms 11,912 KB
testcase_05	AC	6 ms 11,912 KB
testcase_06	AC	6 ms 11,912 KB
testcase_07	AC	7 ms 11,912 KB
testcase_08	AC	6 ms 11,912 KB
testcase_09	AC	5 ms 11,912 KB
testcase_10	AC	6 ms 11,912 KB
testcase_11	AC	878 ms 11,912 KB
testcase_12	AC	885 ms 11,912 KB
testcase_13	AC	852 ms 11,912 KB
testcase_14	AC	886 ms 11,912 KB
testcase_15	AC	799 ms 11,912 KB
testcase_16	AC	1,350 ms 11,912 KB
testcase_17	AC	500 ms 11,912 KB
testcase_18	AC	1,310 ms 11,912 KB
testcase_19	AC	112 ms 11,912 KB
testcase_20	AC	71 ms 11,912 KB
testcase_21	AC	304 ms 11,912 KB
testcase_22	AC	383 ms 11,912 KB
testcase_23	AC	718 ms 11,912 KB
testcase_24	AC	823 ms 11,912 KB
testcase_25	AC	593 ms 11,912 KB
testcase_26	AC	494 ms 11,912 KB
testcase_27	AC	651 ms 11,912 KB
testcase_28	AC	504 ms 11,912 KB
testcase_29	AC	646 ms 11,912 KB
testcase_30	AC	356 ms 11,912 KB
testcase_31	AC	800 ms 11,912 KB
testcase_32	AC	820 ms 11,912 KB
testcase_33	AC	778 ms 11,912 KB
testcase_34	AC	817 ms 11,912 KB
testcase_35	AC	817 ms 11,912 KB
testcase_36	AC	772 ms 11,912 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N;
char S[1510];

Mint dp[2][510][510][2];
Mint DP[2][510][510][2];

int main() {
  for (; ~scanf("%d", &N); ) {
    scanf("%s", S);
    
    const int L = N / 3;
    
    memset(dp, 0, sizeof(dp));
    memset(DP, 0, sizeof(DP));
    dp[0][0][0][0] = 1;
    for (int i = 0; i < N; ++i) {
      auto crt = dp[i & 1], nxt = dp[(i + 1) & 1];
      auto CRT = DP[i & 1], NXT = DP[(i + 1) & 1];
      memset(nxt, 0, sizeof(dp[0]));
      memset(NXT, 0, sizeof(DP[0]));
      const bool can0 = (S[i] == '?' || S[i] == '0');
      const bool can1 = (S[i] == '?' || S[i] == '1');
      const int lim = min({i, N - i, L});
      for (int a = 0; a <= lim; ++a) for (int b = 0; b <= lim - a; ++b) {
        for (int s = 0; s < 2; ++s) if (crt[a][b][s]) {
          // 0
          if (can0 && a + 1 + b <= L) {
            nxt[a + 1][b][0] += crt[a][b][s];
          }
          // 1
          if (can1) {
            if (!s && a) {
              nxt[a - 1][b + 1][1] += crt[a][b][s];
            } else {
              nxt[a][b][1] += crt[a][b][s];
            }
          }
          // 2
          if (can0 && b) {
            NXT[a][b - 1][0] += crt[a][b][s];
          }
        }
      }
      for (int a = 0; a <= lim; ++a) for (int b = 0; b <= lim - a; ++b) {
        for (int s = 0; s < 2; ++s) if (CRT[a][b][s]) {
          // 1
          if (can1) {
            if (!s && a) {
              NXT[a - 1][b + 1][1] += CRT[a][b][s];
            } else {
              NXT[a][b][1] += CRT[a][b][s];
            }
          }
          // 2
          if (can0 && b) {
            NXT[a][b - 1][0] += CRT[a][b][s];
          }
        }
      }
    }
    
    Mint ans = 0;
    for (int s = 0; s < 2; ++s) {
      ans += dp[N & 1][0][0][s];
      ans += DP[N & 1][0][0][s];
    }
    printf("%u\n", ans.x);
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード