結果

問題 No.2554 MMA文字列2 (Query Version)
コンテスト
ユーザー emthrm
提出日時 2023-11-25 16:03:15
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 382 ms / 5,000 ms
コード長 5,043 bytes
コンパイル時間 2,930 ms
コンパイル使用メモリ 258,508 KB
実行使用メモリ 78,356 KB
最終ジャッジ日時 2024-09-26 10:54:09
合計ジャッジ時間 18,195 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 55
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
requires requires {
  typename T::Monoid;
  {T::id()} -> std::same_as<typename T::Monoid>;
  {T::merge(std::declval<typename T::Monoid>(),
            std::declval<typename T::Monoid>())}
      -> std::same_as<typename T::Monoid>;
}
struct SegmentTree {
  using Monoid = typename T::Monoid;

  explicit SegmentTree(const int n)
      : SegmentTree(std::vector<Monoid>(n, T::id())) {}

  explicit SegmentTree(const std::vector<Monoid>& a)
      : n(a.size()), p2(std::bit_ceil(a.size())) {
    dat.assign(p2 << 1, T::id());
    std::copy(a.begin(), a.end(), dat.begin() + p2);
    for (int i = p2 - 1; i > 0; --i) {
      dat[i] = T::merge(dat[i << 1], dat[(i << 1) + 1]);
    }
  }

  void set(int idx, const Monoid val) {
    idx += p2;
    dat[idx] = val;
    while (idx >>= 1) dat[idx] = T::merge(dat[idx << 1], dat[(idx << 1) + 1]);
  }

  Monoid get(int left, int right) const {
    Monoid res_l = T::id(), res_r = T::id();
    for (left += p2, right += p2; left < right; left >>= 1, right >>= 1) {
      if (left & 1) res_l = T::merge(res_l, dat[left++]);
      if (right & 1) res_r = T::merge(dat[--right], res_r);
    }
    return T::merge(res_l, res_r);
  }

  Monoid operator[](const int idx) const { return dat[idx + p2]; }

  template <typename G>
  int find_right(int left, const G g) const {
    if (left >= n) [[unlikely]] return n;
    Monoid val = T::id();
    left += p2;
    do {
      while (!(left & 1)) left >>= 1;
      Monoid nxt = T::merge(val, dat[left]);
      if (!g(nxt)) {
        while (left < p2) {
          left <<= 1;
          nxt = T::merge(val, dat[left]);
          if (g(nxt)) {
            val = nxt;
            ++left;
          }
        }
        return left - p2;
      }
      val = nxt;
      ++left;
    } while (!std::has_single_bit(static_cast<unsigned int>(left)));
    return n;
  }

  template <typename G>
  int find_left(int right, const G g) const {
    if (right <= 0) [[unlikely]] return -1;
    Monoid val = T::id();
    right += p2;
    do {
      --right;
      while (right > 1 && (right & 1)) right >>= 1;
      Monoid nxt = T::merge(dat[right], val);
      if (!g(nxt)) {
        while (right < p2) {
          right = (right << 1) + 1;
          nxt = T::merge(dat[right], val);
          if (g(nxt)) {
            val = nxt;
            --right;
          }
        }
        return right - p2;
      }
      val = nxt;
    } while (!std::has_single_bit(static_cast<unsigned int>(right)));
    return -1;
  }

 private:
  const int n, p2;
  std::vector<Monoid> dat;
};

namespace monoid {

template <typename T>
struct RangeMinimumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return std::numeric_limits<Monoid>::max(); }
  static Monoid merge(const Monoid& a, const Monoid& b) {
    return std::min(a, b);
  }
};

template <typename T>
struct RangeMaximumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return std::numeric_limits<Monoid>::lowest(); }
  static Monoid merge(const Monoid& a, const Monoid& b) {
    return std::max(a, b);
  }
};

template <typename T>
struct RangeSumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return 0; }
  static Monoid merge(const Monoid& a, const Monoid& b) { return a + b; }
};

}  // namespace monoid

int main() {
  constexpr int C = 26;
  struct S {
    using Monoid = array<ll, C * 2 + 1>;
    static constexpr Monoid id() { return {}; }
    static Monoid merge(Monoid a, const Monoid& b) {
      REP(i, C) a.back() += a[i] * b[C + i];
      const int r_num = reduce(b.begin(), next(b.begin(), C), 0);
      REP(i, C) a.back() += a[i] * (a[i] - 1LL) / 2 * (r_num - b[i]);
      REP(i, C) a[C + i] += a[i] * (r_num - b[i]);
      REP(i, C * 2 + 1) a[i] += b[i];
      return a;
    }
  };

  int n, q; string s; cin >> n >> s >> q;
  array<S::Monoid, C> init{};
  REP(i, C) init[i][i] = 1;
  SegmentTree<S> dp(n);
  REP(i, n) dp.set(i, init[s[i] - 'A']);
  while (q--) {
    int type; cin >> type;
    if (type == 1) {
      int x; char c; cin >> x >> c; --x;
      dp.set(x, init[c - 'A']);
    } else if (type == 2) {
      int l, r; cin >> l >> r; --l; --r;
      cout << dp.get(l, r + 1).back() << '\n';
    }
  }
  return 0;
}
0