結果

問題 No.1677 mæx
ユーザー Aoxiang CuiAoxiang Cui
提出日時 2021-09-15 21:35:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 193 ms / 2,000 ms
コード長 5,454 bytes
コンパイル時間 1,362 ms
コンパイル使用メモリ 130,304 KB
実行使用メモリ 19,072 KB
最終ジャッジ日時 2024-06-28 22:58:05
合計ジャッジ時間 3,616 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 103 ms
17,152 KB
testcase_05 AC 102 ms
18,604 KB
testcase_06 AC 96 ms
18,316 KB
testcase_07 AC 96 ms
17,152 KB
testcase_08 AC 95 ms
17,984 KB
testcase_09 AC 95 ms
18,252 KB
testcase_10 AC 94 ms
18,204 KB
testcase_11 AC 97 ms
19,072 KB
testcase_12 AC 97 ms
18,044 KB
testcase_13 AC 103 ms
17,152 KB
testcase_14 AC 119 ms
17,024 KB
testcase_15 AC 114 ms
17,108 KB
testcase_16 AC 107 ms
17,152 KB
testcase_17 AC 119 ms
17,756 KB
testcase_18 AC 111 ms
17,108 KB
testcase_19 AC 2 ms
6,944 KB
testcase_20 AC 2 ms
6,940 KB
testcase_21 AC 193 ms
17,920 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
// const int MOD = 1e9 + 7;
const int MOD = 998244353;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
// mt19937_64 mrand(random_device{}());
// int64 rnd(int64 x) { return mrand() % x; }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

map<char, int> A = {{'a', 0}, {'e', 1}, {'?', 2}};

struct Node {
  int op, t;
  Node* ch[2];
};

const int N = 2e5 + 10;
Node pool[N], *last;

Node* new_node(int op, int t) {
  Node* ret = last++;
  ret->ch[0] = ret->ch[1] = nullptr;
  ret->op = op; ret->t = t;
  return ret;
}

Node* parse(const string& s, int& k) {
  trace(s, k);
  if (s[k] != 'm') {
    if (s[k] >= '0' && s[k] <= '9') {
      return new_node(-1, s[k++] - '0');
    }
    ++k;
    return new_node(-1, -1);
  }
  Node* ret = new_node(A[s[k + 1]], -1);
  k += 4;
  ret->ch[0] = parse(s, k);
  ++k;
  ret->ch[1] = parse(s, k);
  ++k;
  return ret;
}

array<array<int, 3>, 3> mex {};
map<pair<Node*, int>, int> cache;
int solve(Node* p, int target) {
  // trace(p->op, p->t, target);
  auto it = cache.find(make_pair(p, target));
  if (it != cache.end()) return it->second;
  int ret = 0;
  if (p->op == 0 || p->op == 2) {
    for (int x = 0; x <= 2; ++x) {
      for (int y = 0; y <= 2; ++y) {
        if (max(x, y) == target) {
          add(ret, 1LL * solve(p->ch[0], x) * solve(p->ch[1], y) % MOD);
          // trace(p->op, x, y, "max", ret);
        }
      }
    }
  }
  if (p->op == 1 || p->op == 2) {
    for (int x = 0; x <= 2; ++x) {
      for (int y = 0; y <= 2; ++y) {
        if (mex[x][y] == target) {
          add(ret, 1LL * solve(p->ch[0], x) * solve(p->ch[1], y) % MOD);
          // trace(p->op, x, y, "mex", ret);
        }
      }
    }
  }
  if (p->op < 0) {
    if (p->t < 0 || p->t == target) add(ret, 1);
  }
  // trace(p->t, p->op, ret);
  return cache[make_pair(p, target)] = ret;
}

void debug(Node* p, int dep = 0) {
  if (!p) return;
  for (int i = 0; i < dep ; ++i) cout << " ";
  cout << p->op << " " << p->t << '\n';
  debug(p->ch[0], dep + 1);
  debug(p->ch[1], dep + 1);
}

int main() {
  string s;
  cin >> s;
  trace(s, SZ(s));
  int target = 0;
  cin >> target;

  last = pool;
  int k = 0;
  Node* rt = parse(s, k);
  // debug(rt);

  for (int x = 0; x <= 2; ++x) {
    for (int y = 0; y <= 2; ++y) {
      for (int z = 0; z <= 2; ++z) {
        if (z != x && z != y) {
          mex[x][y] = z;
          break;
        }
      }
    }
  }

  int ret = solve(rt, target);
  cout << ret << '\n';
  return 0;
}
0