結果

問題 No.1677 mæx
ユーザー wait_sushiwait_sushi
提出日時 2021-09-10 23:41:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,046 ms / 2,000 ms
コード長 7,632 bytes
コンパイル時間 3,442 ms
コンパイル使用メモリ 229,852 KB
実行使用メモリ 24,984 KB
最終ジャッジ日時 2024-06-12 05:18:55
合計ジャッジ時間 19,947 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
15,104 KB
testcase_01 AC 6 ms
15,044 KB
testcase_02 AC 6 ms
15,104 KB
testcase_03 AC 7 ms
15,104 KB
testcase_04 AC 953 ms
23,256 KB
testcase_05 AC 995 ms
23,260 KB
testcase_06 AC 1,046 ms
23,248 KB
testcase_07 AC 980 ms
23,388 KB
testcase_08 AC 957 ms
23,272 KB
testcase_09 AC 952 ms
23,264 KB
testcase_10 AC 979 ms
23,260 KB
testcase_11 AC 945 ms
23,272 KB
testcase_12 AC 948 ms
23,252 KB
testcase_13 AC 935 ms
23,260 KB
testcase_14 AC 962 ms
23,144 KB
testcase_15 AC 970 ms
23,272 KB
testcase_16 AC 943 ms
23,260 KB
testcase_17 AC 974 ms
23,140 KB
testcase_18 AC 1,005 ms
23,404 KB
testcase_19 AC 6 ms
15,232 KB
testcase_20 AC 6 ms
15,104 KB
testcase_21 AC 958 ms
24,984 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'std::vector<mint> parse(int, int)':
main.cpp:232:1: warning: control reaches end of non-void function [-Wreturn-type]
  232 | }
      | ^

ソースコード

diff # 

#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#pragma comment(linker, "/stack:200000000")
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for (ll i = n; i--;)
#define rrep2(i, n) for (ll i = n; i--;)
#define rrep3(i, a, b) for (ll i = b; i-- > (a);)
#define rrep4(i, a, b, c)                                                      \
  for (ll i = (a) + ((b) - (a)-1) / (c) * (c); i >= (a); i -= c)
#define rrep(...)                                                              \
  overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define elif else if
ll beki(ll i) { return 1ll << i; }
#define skip(M)                                                                \
  if (M)                                                                       \
  continue
#define all(v) v.begin(), v.end()
#define allm(x, y, M) for (auto [(x), (y)] : (M))
#define alls(i, S) for (auto(&i) : (S))
#define pb push_back
#define fi first
#define se second
const ll INF = (1LL << 61) - 1;
// const ll mod = 1000000007;
const ll mod = 998244353;
const ll MAX_N1 = 200010;
const ll MAX_N2 = 500010;
template <class X> void print(X x) { cout << x << endl; }
void print(vl x) {
  for (ll i : x) {
    cout << i << " ";
  }
  cout << endl;
}
void print(vector<PP> x) {
  for (PP i : x) {
    cout << i.first << " " << i.second << endl;
  }
  cout << endl;
}
template <class X> void printr(X x) { cerr << x << endl; }
void printr(vl x) {
  for (ll i : x) {
    cerr << i << " ";
  }
  cerr << endl;
}
void printr(vector<PP> x) {
  for (PP i : x) {
    cerr << i.first << " " << i.second << endl;
  }
  cout << endl;
}
template <class X> int lbound(vector<X> &Y, X a) {
  return lower_bound(all(Y), a) - Y.begin();
}
template <class X> int ubound(vector<X> &Y, X a) {
  return upper_bound(all(Y), a) - Y.begin();
}
template <class X> X lbound2(vector<X> &Y, X a, int mode = 0) {
  int x = lbound(Y, a) - mode;
  if (x < 0 || x >= Y.size())
    return INF;
  return Y[x];
}
template <class X> X ubound2(vector<X> &Y, X a, int mode = 0) {
  int x = ubound(Y, a) - mode;
  if (x < 0 || x >= Y.size())
    return INF;
  return Y[x];
}
template <class... T> void cl(T &... t) { (..., (t.clear())); }
template <class... T> void in(T &... t) { (..., (cin >> t)); }
template <class... T> void put(vl &V, int n, int mode = 0) {
  ll k;
  if (mode == 0)
    cl(V);
  rep(i, n) {
    cin >> k;
    V.pb(k);
  }
}
int max_index(vl &V) { return max_element(all(V)) - V.begin(); }
int min_index(vl &V) { return min_element(all(V)) - V.begin(); }
ll sum(vl &V) { return accumulate(all(V), 0ll); }
template <typename T> void UNIQUE(vector<T> &v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> T ADD(T a, T b) {
  T res;
  return __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
}
template <typename T> T MUL(T a, T b) {
  T res;
  return __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
};
template <typename T> T POW(T a, int n) {
  T res = 1;
  for (; n > 0; n >>= 1, a *= a)
    if (n & 1)
      res *= a;
  return res;
}
template <class X> bool ma(X &a, X b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class X> bool mi(X &a, X b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
void vset(vl &A, ll n, ll k) { A = vl(n, k); }
void so(vl &A) { sort(all(A)); }
ll age(ll x, ll y) { return (x + y - 1) / y; }
ll a, b, c, d, aa, bb, cc, dd, h, x, y, z, p, q, n, t, r, k, w, l, ans, m, u, v;
ll codeforces = 1;
string S, T, U;
vl A, B, C, D;
vl g[MAX_N2];
vector<PP> VP, VP2;
set<ll> s1, s2;
struct mint {
  using ull = unsigned long long int;
  ull v;
  mint(ll vv = 0) { s(vv % mod + mod); }
  mint &s(ull vv) {
    v = vv < mod ? vv : vv - mod;
    return *this;
  }
  //オーバーロード
  mint operator-() const { return mint() - *this; } // mint型にキャスト
  mint &operator+=(const mint &val) { return s(v + val.v); }
  mint &operator-=(const mint &val) { return s(v + mod - val.v); }
  mint &operator*=(const mint &val) {
    v = ull(v) * val.v % mod;
    return *this;
  }
  mint &operator/=(const mint &val) { return *this *= val.inv(); }
  mint operator+(const mint &val) { return mint(*this) += val; }
  mint operator-(const mint &val) { return mint(*this) -= val; }
  mint operator*(const mint &val) { return mint(*this) *= val; }
  mint operator/(const mint &val) { return mint(*this) /= val; }
  mint pow(ll n) const {
    mint res(1), x(*this);
    while (n) {
      if (n & 1)
        res *= x;
      x *= x;
      n >>= 1ll;
    }
    return res;
  }
  mint inv() const { return pow(mod - 2); }
  //拡張ユークリッドの互除法
  /* mint inv()const{
  int x,y;
  int g=extgcd(v,mod,x,y);
  assert(g==1);
  if(x<0)x+=mod;
  return mint(x);
  }*/
  friend ostream &operator<<(ostream &os, const mint &val) {
    return os << val.v;
  } //出力
  bool operator<(const mint &val) const { return v < val.v; }
  bool operator==(const mint &val) const { return v == val.v; }
  bool operator>(const mint &val) const { return v > val.v; }
};
vector<mint> parse(int x, int y) {
  if (x == y) {

    if (S[x] == '?')
      return {1, 1, 1};
    if (S[x] == '0')
      return {1, 0, 0};
    if (S[x] == '1')
      return {0, 1, 0};
    if (S[x] == '2')
      return {0, 0, 1};
  }
  if (S[x + 1] == 'a') {
    ll p = A[x + 3];
    ll q = B[x + 3];
    vector<mint> V1 = parse(x + 4, q - 1);
    vector<mint> V2 = parse(q + 1, p - 1);
    return {V1[0] * V2[0], V1[1] * V2[1] + V1[1] * V2[0] + V1[0] * V2[1],
            V1[2] * V2[2] + V1[1] * V2[2] + V1[0] * V2[2] + V1[2] * V2[1] +
                V1[2] * V2[0]};
  }
  if (S[x + 1] == 'e') {
    ll p = A[x + 3];
    ll q = B[x + 3];
    vector<mint> V1 = parse(x + 4, q - 1);
    vector<mint> V2 = parse(q + 1, p - 1);
    return {V1[2] * V2[1] + V1[1] * V2[2] + V1[1] * V2[1] + V1[2] * V2[2],
            V1[0] * V2[0] + V1[0] * V2[2] + V1[2] * V2[0],
            V1[1] * V2[0] + V1[0] * V2[1]};
  }
  if (S[x + 1] == '?') {
    ll p = A[x + 3];
    ll q = B[x + 3];
    vector<mint> V1 = parse(x + 4, q - 1);
    vector<mint> V2 = parse(q + 1, p - 1);

    return {V1[0] * V2[0] + V1[2] * V2[1] + V1[1] * V2[2] + V1[1] * V2[1] +
                V1[2] * V2[2],
            V1[1] * V2[1] + V1[1] * V2[0] + V1[0] * V2[1] + V1[0] * V2[0] +
                V1[0] * V2[2] + V1[2] * V2[0],
            V1[2] * V2[2] + V1[1] * V2[2] + V1[0] * V2[2] + V1[2] * V2[1] +
                V1[2] * V2[0] + V1[1] * V2[0] + V1[0] * V2[1]};
  }
}
void solve() {
  in(S);
  stack<ll> S1, S2;
  n = S.length();
  vset(A, n, 0);
  vset(B, n, 0);
  rep(i, n) {
    if (S[i] == '(')
      S1.push(i);
    if (S[i] == ',')
      S2.push(i);
    if (S[i] == ')') {
      x = S1.top();
      y = S2.top();
      A[x] = i;
      B[x] = y;
      S1.pop();
      S2.pop();
    }
  }
  printr(A);
  printr(B);
  vector<mint> V1 = parse(0, n - 1);
  in(k);
  print(V1[k]);
}
int main() {
  cout << fixed << setprecision(15);
  cin.tie(0);
  ios::sync_with_stdio(false);
  // cin >> codeforces;
  while (codeforces--) {
    ans = 0;
    solve();
  }
}
0