提出 #67004781

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
constexpr int MAXN = 1'000'007;
constexpr int INF = 2'000'000'000;
constexpr ll INFF = 1'000'000'000'000'000'000LL;
constexpr ll MOD = 998'244'353;
#define mkp make_pair
#define F first
#define S second
#define pb emplace_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()

ll ppow(ll x, ll y) {
  ll ret = 1;
  while (y) {
    if (y & 1)
      ret = ret * x % MOD;
    x = x * x % MOD;
    y >>= 1;
  }
  return ret;
}

int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) {
    constexpr int C = 543210;
    vector<int> lc(C, -1), rc(C, -1);
    vector<ll> dp(C), nodes(C), tag(C);

    string s;
    int nn = 1;
    function<void(int, int)> ins = [&](int cur_node, int idx) {
      if (idx < sz(s)) {
        if (s[idx] == 'A') {
          if (lc[cur_node] == -1) {
            lc[cur_node] = nn++;
          }
          ins(lc[cur_node], idx + 1);
        } else {
          if (rc[cur_node] == -1) {
            rc[cur_node] = nn++;
          }
          ins(rc[cur_node], idx + 1);
        }
      } else {
        tag[cur_node] = 1;
      }
      nodes[cur_node] = tag[cur_node];
      if (lc[cur_node] != -1)
        nodes[cur_node] += nodes[lc[cur_node]];
      if (rc[cur_node] != -1)
        nodes[cur_node] += nodes[rc[cur_node]];

    //   cout << cur_node << ' ' << lc[cur_node] << ' ' << rc[cur_node] << '\n';
      if (tag[cur_node] == 1) {
        dp[cur_node] = ppow(2, nodes[cur_node] - 1);
        if (lc[cur_node] != -1 && rc[cur_node] != -1)
          dp[cur_node] += dp[lc[cur_node]] * dp[rc[cur_node]];
        dp[cur_node] %= MOD;
      } else {
        dp[cur_node] = 0;
        if (lc[cur_node] != -1 && rc[cur_node] != -1)
          dp[cur_node] += dp[lc[cur_node]] * dp[rc[cur_node]];
        dp[cur_node] %= MOD;
      }
    };

    int n;
    cin >> n;
    while (n--) {
      cin >> s;
      ins(0, 0);
      cout << dp[0] << '\n';
    }
  }
}
/*
- How to come up with solutions? (https://hackmd.io/-3cIVAFSQMC3iJTh9EpszA)
  - Play with some small examples.
  - Make observations (or random guesses) by intuition.
    - Try to find counterexamples of the "observations."
  - Find the characteristics of an optimal solution.
  - Try to solve simple cases.
  - Brute force and print out the results.
  - Pick a method (greedy, dp, d&c, ...)
    - But DO NOT force algos on problems!
  - IF YOU'RE STUCK, TRY SOMETHING ELSE! Make new observations!

- Before writing the solution:
  - check TL/ML/correctness of samples/implementation details!

- Pre-submit:
  - Did you make a typo when copying a template?
  - Test more cases if unsure.
    - Write a naive solution and check small cases.
  - Submit the correct file.

- Debugging:
  - General Debugging:
    - Read the whole problem again.
    - Think over the algorithm again.
    - Go to the toilet.

  - Wrong Answer:
    - Any possible overflows?
      - > `__int128` ?
      - Try `-ftrapv` or `#pragma GCC optimize("trapv")`
    - Floating point errors?
      - > `long double` ?
      - turn off math optimizations
      - check for `==`, `>=`, `acos(1.000000001)`, etc.
    - Did you forget to sort or unique?
    - Generate large and worst "corner" cases.
    - Check your `m` / `n`, `i` / `j`,  `x` / `y` and `<` / `>`.
    - Are everything initialized or reset properly?
    - Are you sure about the STL thing you are using?
      - Read cppreference.
    - Print everything and run it on pen and paper.

  - Time Limit Exceeded:
    - Calculate your time complexity again.
    - Does the program actually end?
      - Check for `while(q.size())` etc.
    - Test the largest cases locally.
    - Did you do unnecessary stuff?
      - e.g. pass vectors by value
      - e.g. `memset` for every test case
    - Is your constant factor reasonable?

  - Runtime Error:
    - Check memory usage.
      - Forget to clear or destroy stuff?
      - > `vector::shrink_to_fit()`
    - Stack overflow?
    - Bad pointer / array access?
      - Try `-fsanitize=address`
    - Division by zero? NaN's?
*/

提出情報

ジャッジ結果