結果

問題 No.1677 mæx
ユーザー NyaanNyaanNyaanNyaan
提出日時 2021-09-10 23:31:34
言語 C++11
(gcc 11.4.0)
結果
RE  
実行時間 -
コード長 7,975 bytes
コンパイル時間 1,115 ms
コンパイル使用メモリ 105,136 KB
実行使用メモリ 14,936 KB
最終ジャッジ日時 2023-09-02 22:28:26
合計ジャッジ時間 5,358 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 RE -
testcase_02 RE -
testcase_03 AC 5 ms
8,068 KB
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 AC 4 ms
8,184 KB
testcase_20 AC 4 ms
8,008 KB
testcase_21 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(x, s, t) for (llint x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for (llint x = (s); (x) >= (t); (x)--)
#define reps(x, s) for (llint x = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x) + (y)-1) / (y))
#define all(x) (x).begin(), (x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge {
  ll to, cost;
  edge() {}
  edge(ll a, ll b) { to = a, cost = b; }
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

// const ll mod = 1000000007;
const ll mod = 998244353;

struct mint {
  ll x = 0;
  mint(ll y = 0) {
    x = y;
    if (x < 0 || x >= mod) x = (x % mod + mod) % mod;
  }
  mint(const mint& ope) { x = ope.x; }

  mint operator-() { return mint(-x); }
  mint operator+(const mint& ope) { return mint(x) += ope; }
  mint operator-(const mint& ope) { return mint(x) -= ope; }
  mint operator*(const mint& ope) { return mint(x) *= ope; }
  mint operator/(const mint& ope) { return mint(x) /= ope; }
  mint& operator+=(const mint& ope) {
    x += ope.x;
    if (x >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint& ope) {
    x += mod - ope.x;
    if (x >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint& ope) {
    x *= ope.x, x %= mod;
    return *this;
  }
  mint& operator/=(const mint& ope) {
    ll n = mod - 2;
    mint mul = ope;
    while (n) {
      if (n & 1) *this *= mul;
      mul *= mul;
      n >>= 1;
    }
    return *this;
  }
  mint inverse() { return mint(1) / *this; }
  bool operator==(const mint& ope) { return x == ope.x; }
  bool operator!=(const mint& ope) { return x != ope.x; }
};
mint modpow(mint a, ll n) {
  if (n == 0) return mint(1);
  if (n % 2)
    return a * modpow(a, n - 1);
  else
    return modpow(a * a, n / 2);
}
istream& operator>>(istream& is, mint& ope) {
  ll t;
  is >> t, ope.x = t;
  return is;
}
ostream& operator<<(ostream& os, mint& ope) { return os << ope.x; }
ostream& operator<<(ostream& os, const mint& ope) { return os << ope.x; }

vector<mint> fact, fact_inv;
void make_fact(int n) {
  fact.resize(n + 1), fact_inv.resize(n + 1);
  fact[0] = mint(1);
  rep(i, 1, n) fact[i] = fact[i - 1] * mint(i);
  fact_inv[n] = fact[n].inverse();
  per(i, n - 1, 0) fact_inv[i] = fact_inv[i + 1] * mint(i + 1);
}
mint comb(ll n, ll k) {
  if (n < 0 || k < 0 || n < k) return mint(0);
  return fact[n] * fact_inv[k] * fact_inv[n - k];
}
mint perm(ll n, ll k) { return comb(n, k) * fact[k]; }

vector<int> prime;
void make_prime(int n) {
  prime.resize(n + 1);
  rep(i, 2, n) {
    if (prime[i]) continue;
    for (int j = i; j <= n; j += i) prime[j] = i;
  }
}

bool exceed(ll x, ll y, ll m) { return x >= m / y + 1; }
void mark() { cout << "*" << endl; }
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
ll sgn(ll x) {
  if (x > 0) return 1;
  if (x < 0) return -1;
  return 0;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll digitnum(ll x, ll b = 10) {
  ll ret = 0;
  for (; x; x /= b) ret++;
  return ret;
}
ll digitsum(ll x, ll b = 10) {
  ll ret = 0;
  for (; x; x /= b) ret += x % b;
  return ret;
}
string lltos(ll x) {
  string ret;
  for (; x; x /= 10) ret += x % 10 + '0';
  reverse(ret.begin(), ret.end());
  return ret;
}
ll stoll(string& s) {
  ll ret = 0;
  for (auto c : s) ret *= 10, ret += c - '0';
  return ret;
}
template <typename T>
void uniq(T& vec) {
  sort(vec.begin(), vec.end());
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
}

template <class S, class T>
pair<S, T>& operator+=(pair<S, T>& s, const pair<S, T>& t) {
  s.first += t.first, s.second += t.second;
  return s;
}
template <class S, class T>
pair<S, T>& operator-=(pair<S, T>& s, const pair<S, T>& t) {
  s.first -= t.first, s.second -= t.second;
  return s;
}
template <class S, class T>
pair<S, T> operator+(const pair<S, T>& s, const pair<S, T>& t) {
  return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T>& s, const pair<S, T>& t) {
  return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, deque<T>& deq) {
  for (int i = 0; i < deq.size(); i++)
    os << deq[i] << (i + 1 == deq.size() ? "" : " ");
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, pair<T, U>& pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, map<T, U>& map_var) {
  for (typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end();
       itr++) {
    os << "(" << itr->first << ", " << itr->second << ")";
    itr++;
    if (itr != map_var.end()) os << ",";
    itr--;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, set<T>& set_var) {
  for (typename set<T>::iterator itr = set_var.begin(); itr != set_var.end();
       itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, multiset<T>& set_var) {
  for (typename multiset<T>::iterator itr = set_var.begin();
       itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}
template <typename T>
void outa(T a[], ll s, ll t) {
  for (ll i = s; i <= t; i++) {
    cout << a[i];
    if (i < t) cout << " ";
  }
  cout << endl;
}
void dump_func() { cout << endl; }
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(Tail) > 0) cout << " ";
  dump_func(std::move(tail)...);
}

struct Node {
  string s;
  ll l, r;
  Node() { s = "", l = r = -1; }
};

string s;
ll k;
vector<Node> vec;

ll parse(ll& p) {
  vec.push_back(Node());
  ll v = sz(vec) - 1;
  if (s[p] == '0' || s[p] == '1' || s[p] == '2' || s[p] == '?') {
    vec[v].s = s[p];
    p++;
    return v;
  }
  if (s[p] == 'm') {
    p++;
    if (s[p] == 'a') vec[v].s = "max";
    if (s[p] == 'e') vec[v].s = "mex";
    if (s[p] == '?') vec[v].s = "m?x";
    p += 3;
    vec[v].l = parse(p);
    p++;
    vec[v].r = parse(p);
    p++;
    return v;
  }
  assert(0);
}

ll mex(ll a, ll b) {
  if (min(a, b) >= 1) return 0;
  if ((a + b) % 2)
    return 2;
  else
    return 1;
}

mint dp[200005][3];

void dfs(int v) {
  if (sz(vec[v].s) == 1) {
    rep(i, 0, 2) if (vec[v].s[0] == '?' || vec[v].s[0] == '0' + i) dp[v][i] = 1;
    return;
  }
  ll l = vec[v].l, r = vec[v].r;
  assert(l != -1 && r != -1);
  dfs(l), dfs(r);
  if (vec[v].s != "mex") {
    rep(i, 0, 2) rep(j, 0, 2) dp[v][max(i, j)] += dp[l][i] * dp[r][j];
  }
  if (vec[v].s != "max") {
    rep(i, 0, 2) rep(j, 0, 2) dp[v][mex(i, j)] += dp[l][i] * dp[r][j];
  }
}

int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);

  cin >> s >> k;

  ll p = 0;
  parse(p);

  dfs(0);
  outl(dp[0][k]);

  return 0;
}
0