結果

問題 No.2265 Xor Range Substring Sum Query
コンテスト
ユーザー ei1333333
提出日時 2023-04-07 22:15:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 7,375 bytes
コンパイル時間 2,735 ms
コンパイル使用メモリ 205,668 KB
最終ジャッジ日時 2025-02-12 01:36:55
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 WA * 1
other AC * 1 WA * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

#line 1 "math/combinatorics/montgomery-mod-int.hpp"
/**
 * @brief Montgomery ModInt
 */
template< uint32_t mod, bool fast = false >
struct MontgomeryModInt {
  using mint = MontgomeryModInt;
  using i32 = int32_t;
  using i64 = int64_t;
  using u32 = uint32_t;
  using u64 = uint64_t;

  static constexpr u32 get_r() {
    u32 ret = mod;
    for(i32 i = 0; i < 4; i++) ret *= 2 - mod * ret;
    return ret;
  }

  static constexpr u32 r = get_r();
  static constexpr u32 n2 = -u64(mod) % mod;

  static_assert(r * mod == 1, "invalid, r * mod != 1");
  static_assert(mod < (1 << 30), "invalid, mod >= 2 ^ 30");
  static_assert((mod & 1) == 1, "invalid, mod % 2 == 0");

  u32 x;

  MontgomeryModInt() : x{} {}

  MontgomeryModInt(const i64 &a)
      : x(reduce(u64(fast ? a : (a % mod + mod)) * n2)) {}

  static constexpr u32 reduce(const u64 &b) {
    return u32(b >> 32) + mod - u32((u64(u32(b) * r) * mod) >> 32);
  }

  mint &operator+=(const mint &p) {
    if(i32(x += p.x - 2 * mod) < 0) x += 2 * mod;
    return *this;
  }

  mint &operator-=(const mint &p) {
    if(i32(x -= p.x) < 0) x += 2 * mod;
    return *this;
  }

  mint &operator*=(const mint &p) {
    x = reduce(u64(x) * p.x);
    return *this;
  }

  mint &operator/=(const mint &p) {
    *this *= p.inverse();
    return *this;
  }

  mint operator-() const { return mint() - *this; }

  mint operator+(const mint &p) const { return mint(*this) += p; }

  mint operator-(const mint &p) const { return mint(*this) -= p; }

  mint operator*(const mint &p) const { return mint(*this) *= p; }

  mint operator/(const mint &p) const { return mint(*this) /= p; }

  bool operator==(const mint &p) const { return (x >= mod ? x - mod : x) == (p.x >= mod ? p.x - mod : p.x); }

  bool operator!=(const mint &p) const { return (x >= mod ? x - mod : x) != (p.x >= mod ? p.x - mod : p.x); }

  u32 get() const {
    u32 ret = reduce(x);
    return ret >= mod ? ret - mod : ret;
  }

  mint pow(u64 n) const {
    mint ret(1), mul(*this);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  mint inverse() const {
    return pow(mod - 2);
  }

  friend ostream &operator<<(ostream &os, const mint &p) {
    return os << p.get();
  }

  friend istream &operator>>(istream &is, mint &a) {
    i64 t;
    is >> t;
    a = mint(t);
    return is;
  }

  static u32 get_mod() { return mod; }
};

using modint = MontgomeryModInt< mod >;



/* https://codeforces.com/contest/1654/submission/150260896 */

struct monoid {
  int len;
  modint f;

  monoid() : len(0), f(0) {}

  monoid(modint f) : len(1), f(f) {}
};

modint mul11[1 << 18], mul2[1 << 18];

monoid f(monoid L, monoid R) {
  monoid ans;
  ans.len = L.len + R.len;
  ans.f = L.f * mul11[R.len] + R.f * mul2[L.len];
  return ans;
}

struct segment_tree {
  int N;
  vector< vector< monoid>> ST;

  segment_tree(const vector< monoid > &S) {
    N = (int) S.size();
    ST = vector< vector< monoid>>(N * 2 - 1);
    for(int i = 0; i < N; i++) {
      ST[N - 1 + i].push_back(S[i]);
    }
    for(int i = N - 2; i >= 0; i--) {
      int cnt = ST[i * 2 + 1].size();
      for(int j = 0; j < cnt; j++) {
        ST[i].push_back(f(ST[i * 2 + 1][j], ST[i * 2 + 2][j]));
      }
      for(int j = 0; j < cnt; j++) {
        ST[i].push_back(f(ST[i * 2 + 2][j], ST[i * 2 + 1][j]));
      }
    }
  }

  monoid range_fold(int L, int R, int x, int i, int l, int r) {
    if(r <= L || R <= l) {
      return monoid();
    } else if(L <= l && r <= R) {
      assert(x < ST[i].size());
      return ST[i][x];
    } else {
      int p = (r - l) / 2;
      int m = (l + r) / 2;
      if((x & p) == 0) {
        monoid resL = range_fold(L, R, x, i * 2 + 1, l, m);
        monoid resR = range_fold(L, R, x, i * 2 + 2, m, r);
        return f(resL, resR);
      } else {
        x ^= p;
        monoid resL;
        if(R >= m) {
          resL = range_fold(max(L, m) - p, R - p, x, i * 2 + 1, l, m);
        }
        monoid resR;
        if(L < m) {
          resR = range_fold(L + p, min(R, m) + p, x, i * 2 + 2, m, r);
        }
        return f(resR, resL);
      }
    }
  }

  monoid range_fold(int L, int R, int x) {
    return range_fold(L, R, x, 0, 0, N);
  }

  monoid update(int L, int R, monoid t, int i, int l, int r) {
    if(r <= L || R <= l) {
      return ST[i][0];
    } else if(L <= l && r <= R) {
      return ST[i][0] = t;
    } else {
      int m = (l + r) / 2;
      monoid resL = update(L, R, t, i * 2 + 1, l, m);
      monoid resR = update(L, R, t, i * 2 + 2, m, r);
      ST[i][0] = f(resL, resR);
      ST[i][ST[i].size()>>1] = f(resR, resL);
      return ST[i][0];
    }
  }

  monoid update(int L, monoid x) {
    return update(L, L + 1, x, 0, 0, N);
  }
};

int main() {
  int N;
  cin >> N;
  mul11[0] = mul2[0] = 1;
  for(int i = 1; i < (1 << N); i++) {
    mul11[i] = mul11[i - 1] * 11;
    mul2[i] = mul2[i - 1] * 2;
  }
  string S;
  cin >> S;
  for(auto& c : S) c -= '0';
  int Q;
  cin >> Q;
  vector< monoid > vs(1 << N);
  for(int i = 0; i < 1 << N; i++) vs[i] = monoid(S[i]);
  auto segs = segment_tree(vs);
  while(Q--) {
    int t;
    cin >> t;
    if(t == 1) {
      int x, y;
      cin >> x >> y;
      segs.update(x, monoid(y));
    } else {
      int l, r, x;
      cin >> l >> r >> x;
      ++r;
      cout << segs.range_fold(l, r, x).f << "\n";
    }
  }
}
0