結果

問題 No.1677 mæx
コンテスト
ユーザー emthrm
提出日時 2021-09-10 22:31:31
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,566 bytes
コンパイル時間 8,106 ms
コンパイル使用メモリ 250,328 KB
最終ジャッジ日時 2025-01-24 11:33:03
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:135:12: error: no matching function for call to 'erase(std::__cxx11::basic_string<char>::size_type, char)'
  135 |   s = erase(erase(s, 'm'), 'x');
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bits/locale_classes.h:40,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bits/ios_base.h:41,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/ios:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/istream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:2:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/string:135:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc, class _Up> constexpr typename std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size_type std::erase(__cxx11::basic_string<_CharT, _Traits, _Allocator>&, const _Up&)'
  135 |     erase(basic_string<_CharT, _Traits, _Alloc>& __cont, const _Up& __value)
      |     ^~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/string:135:5: note:   template argument deduction/substitution failed:
main.cpp:135:12: note:   mismatched types 'std::__cxx11::basic_string<_CharT, _Traits, _Allocator>' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'}
  135 |   s = erase(erase(s, 'm'), 'x');
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/x86_64-pc-linux-

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <int M>
struct MInt {
  unsigned int val;
  MInt(): val(0) {}
  MInt(long long x) : val(x >= 0 ? x % M : x % M + M) {}
  static constexpr int get_mod() { return M; }
  static void set_mod(int divisor) { assert(divisor == M); }
  static void init(int x = 10000000) { inv(x, true); fact(x); fact_inv(x); }
  static MInt inv(int x, bool init = false) {
    // assert(0 <= x && x < M && std::__gcd(x, M) == 1);
    static std::vector<MInt> inverse{0, 1};
    int prev = inverse.size();
    if (init && x >= prev) {
      // "x!" and "M" must be disjoint.
      inverse.resize(x + 1);
      for (int i = prev; i <= x; ++i) inverse[i] = -inverse[M % i] * (M / i);
    }
    if (x < inverse.size()) return inverse[x];
    unsigned int a = x, b = M; int u = 1, v = 0;
    while (b) {
      unsigned int q = a / b;
      std::swap(a -= q * b, b);
      std::swap(u -= q * v, v);
    }
    return u;
  }
  static MInt fact(int x) {
    static std::vector<MInt> f{1};
    int prev = f.size();
    if (x >= prev) {
      f.resize(x + 1);
      for (int i = prev; i <= x; ++i) f[i] = f[i - 1] * i;
    }
    return f[x];
  }
  static MInt fact_inv(int x) {
    static std::vector<MInt> finv{1};
    int prev = finv.size();
    if (x >= prev) {
      finv.resize(x + 1);
      finv[x] = inv(fact(x).val);
      for (int i = x; i > prev; --i) finv[i - 1] = finv[i] * i;
    }
    return finv[x];
  }
  static MInt nCk(int n, int k) {
    if (n < 0 || n < k || k < 0) return 0;
    if (n - k > k) k = n - k;
    return fact(n) * fact_inv(k) * fact_inv(n - k);
  }
  static MInt nPk(int n, int k) { return n < 0 || n < k || k < 0 ? 0 : fact(n) * fact_inv(n - k); }
  static MInt nHk(int n, int k) { return n < 0 || k < 0 ? 0 : (k == 0 ? 1 : nCk(n + k - 1, k)); }
  static MInt large_nCk(long long n, int k) {
    if (n < 0 || n < k || k < 0) return 0;
    inv(k, true);
    MInt res = 1;
    for (int i = 1; i <= k; ++i) res *= inv(i) * n--;
    return res;
  }
  MInt pow(long long exponent) const {
    MInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  MInt &operator+=(const MInt &x) { if((val += x.val) >= M) val -= M; return *this; }
  MInt &operator-=(const MInt &x) { if((val += M - x.val) >= M) val -= M; return *this; }
  MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % M; return *this; }
  MInt &operator/=(const MInt &x) { return *this *= inv(x.val); }
  bool operator==(const MInt &x) const { return val == x.val; }
  bool operator!=(const MInt &x) const { return val != x.val; }
  bool operator<(const MInt &x) const { return val < x.val; }
  bool operator<=(const MInt &x) const { return val <= x.val; }
  bool operator>(const MInt &x) const { return val > x.val; }
  bool operator>=(const MInt &x) const { return val >= x.val; }
  MInt &operator++() { if (++val == M) val = 0; return *this; }
  MInt operator++(int) { MInt res = *this; ++*this; return res; }
  MInt &operator--() { val = (val == 0 ? M : val) - 1; return *this; }
  MInt operator--(int) { MInt res = *this; --*this; return res; }
  MInt operator+() const { return *this; }
  MInt operator-() const { return MInt(val ? M - val : 0); }
  MInt operator+(const MInt &x) const { return MInt(*this) += x; }
  MInt operator-(const MInt &x) const { return MInt(*this) -= x; }
  MInt operator*(const MInt &x) const { return MInt(*this) *= x; }
  MInt operator/(const MInt &x) const { return MInt(*this) /= x; }
  friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }
  friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }
};
namespace std { template <int M> MInt<M> abs(const MInt<M> &x) { return x; } }
using ModInt = MInt<MOD>;

string erase(const string &s, char ban) {
  string t = "";
  for (char c : s) {
    if (c != ban) t += c;
  }
  return t;
}

int mex(int a, int b) {
  if (a > b) swap(a, b);
  if (a > 0) return 0;
  return b == 1 ? 2 : 1;
}

int main() {
  constexpr int K = 3;
  string s; int k; cin >> s >> k;
  s = erase(erase(s, 'm'), 'x');
  const int n = s.length();
  if (n == 1) {
    cout << (s.front() - '0' == k ? 1 : 0) << '\n';
    return 0;
  }
  vector<int> m(n, -1), r(n, -1), l;
  REP(i, n) {
    if (s[i] == '(') {
      l.emplace_back(i);
    } else if (s[i] == ',') {
      m[l.back()] = i;
    } else if (s[i] == ')') {
      r[l.back()] = i;
      l.pop_back();
    }
  }
  vector<vector<int>> graph;
  vector<char> ae;
  auto f = [&](auto &&f, int le, int ri) -> int {
    const int idx = graph.size();
    graph.emplace_back();
    ae.emplace_back(s[le]);
    if (le + 1 < ri) {
      int child = f(f, le + 2, m[le + 1]);
      graph[idx].emplace_back(child);
      child = f(f, m[le + 1] + 1, r[le + 1]);
      graph[idx].emplace_back(child);

      // これはバグる
      // graph[idx].emplace_back(f(f, le + 2, m[le + 1]));
      // graph[idx].emplace_back(f(f, m[le + 1] + 1, r[le + 1]));
    }
    return idx;
  };
  assert(f(f, 0, n) == 0);
  auto g = [&](auto &&g, int ver) -> vector<ModInt> {
    vector<ModInt> dp(K, 0);
    if (graph[ver].empty()) {
      if (ae[ver] == '?') {
        fill(ALL(dp), 1);
      } else {
        dp[ae[ver] - '0'] = 1;
      }
    } else {
      vector<ModInt> a = g(g, graph[ver][0]), b = g(g, graph[ver][1]);
      REP(i, K) REP(j, K) {
        if (ae[ver] == '?' || ae[ver] == 'a') {
          dp[max(i, j)] += a[i] * b[j];
        }
        if (ae[ver] == '?' || ae[ver] == 'e') {
          dp[mex(i, j)] += a[i] * b[j];
        }
      }
    }
    return dp;
  };
  cout << g(g, 0)[k] << '\n';
  return 0;
}
0