結果

問題 No.2265 Xor Range Substring Sum Query
ユーザー 👑 hos.lyrichos.lyric
提出日時 2023-04-07 22:04:57
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 733 ms / 5,000 ms
コード長 5,611 bytes
コンパイル時間 986 ms
コンパイル使用メモリ 109,156 KB
実行使用メモリ 25,216 KB
最終ジャッジ日時 2024-10-02 19:35:28
合計ジャッジ時間 14,442 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 726 ms
25,088 KB
testcase_05 AC 733 ms
25,088 KB
testcase_06 AC 724 ms
25,088 KB
testcase_07 AC 714 ms
25,216 KB
testcase_08 AC 722 ms
25,088 KB
testcase_09 AC 683 ms
25,088 KB
testcase_10 AC 694 ms
25,088 KB
testcase_11 AC 703 ms
25,216 KB
testcase_12 AC 674 ms
25,088 KB
testcase_13 AC 678 ms
25,088 KB
testcase_14 AC 602 ms
25,088 KB
testcase_15 AC 613 ms
25,088 KB
testcase_16 AC 637 ms
25,088 KB
testcase_17 AC 636 ms
25,088 KB
testcase_18 AC 232 ms
25,088 KB
testcase_19 AC 234 ms
25,088 KB
testcase_20 AC 249 ms
25,088 KB
testcase_21 AC 258 ms
25,088 KB
testcase_22 AC 503 ms
13,952 KB
testcase_23 AC 500 ms
13,824 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


constexpr int MAX_E = 18;

int E;
char S[(1 << MAX_E) + 10];

vector<int> as;

Mint base[(1 << MAX_E) + 10];
Mint f[MAX_E + 1][(1 << MAX_E) + 10];
void build() {
  for (int i = 0; i < 1 << E; ++i) {
    f[0][i] = as[i];
  }
  for (int e = 0; e < E; ++e) {
    for (int i = 0; i < 1 << E; ++i) {
      f[e + 1][i] = f[e][i] + base[1 << e] * f[e][i ^ 1 << e];
    }
  }
}

int L, R, X;
pair<Mint, int> dfs(int e, int a, int b) {
  if (b <= L || R <= a) return make_pair(0, 0);
  if (L <= a && b <= R) return make_pair(f[e][X ^ a], 1 << e);
  const int mid = (a + b) >> 1;
  const auto resL = dfs(e - 1, a, mid);
  const auto resR = dfs(e - 1, mid, b);
  return make_pair(resL.first + base[resL.second] * resR.first, resL.second + resR.second);
}

int main() {
  for (; ~scanf("%d", &E); ) {
    scanf("%s", S);
    
    base[0] = 1;
    base[1] = Mint(2) / Mint(11);
    for (int i = 2; i <= 1 << E; ++i) {
      base[i] = base[i - 1] * base[1];
    }
    
    as.resize(1 << E);
    for (int i = 0; i < 1 << E; ++i) {
      as[i] = S[i] - '0';
    }
    build();
    
    const int K = max((int)sqrt(E << E), 1);
    int psLen = 0;
    vector<pair<int, Mint>> ps(K);
    
    int Q;
    scanf("%d", &Q);
    for (; Q--; ) {
      int typ;
      scanf("%d", &typ);
      if (typ == 1) {
        int x, y;
        scanf("%d%d", &x, &y);
        
        ps[psLen++] = make_pair(x, y - as[x]);
        as[x] = y;
        if (psLen == K) {
          build();
          psLen = 0;
        }
      } else {
        scanf("%d%d%d", &L, &R, &X);
        ++R;
        
        Mint ans = dfs(E, 0, 1 << E).first;
        for (int j = 0; j < psLen; ++j) {
          const int pos = ps[j].first ^ X;
          if (L <= pos && pos < R) {
            ans += base[pos - L] * ps[j].second;
          }
        }
        ans *= Mint(11).pow(R - L - 1);
        printf("%u\n", ans.x);
      }
    }
  }
  return 0;
}
0