結果
| 問題 |
No.3239 Omnibus
|
| コンテスト | |
| ユーザー |
 siganai
|
| 提出日時 | 2025-08-15 23:05:44 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 4,191 ms / 10,000 ms |
| コード長 | 11,483 bytes |
| コンパイル時間 | 4,405 ms |
| コンパイル使用メモリ | 351,652 KB |
| 実行使用メモリ | 129,924 KB |
| 最終ジャッジ日時 | 2025-08-15 23:07:32 |
| 合計ジャッジ時間 | 88,145 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 33 |
ソースコード
#line 1 "main.cpp"
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#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) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + (((b)-(a)-1) / (c) - (((b)-(a)-1) % (c) && (((b)-(a)-1) ^ c) < 0)) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename T>
T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}
template <typename T>
T ceil(T x, T y) {return floor(x + y - 1, y);}
template <typename T>
T bmod(T x, T y) {return x - y * floor(x, y);}
template <typename T>
pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
F f;
REC(F &&f_) : f(forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
#line 2 "library/data-structure/fenwick-tree-on-wavelet-matrix.hpp"
#include <immintrin.h>
struct bit_vector {
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
static constexpr u32 w = 64;
vector<u64> block;
vector<u32> count;
u32 n, zeros;
inline u32 get(u32 i) const { return u32(block[i / w] >> (i % w)) & 1u; }
inline void set(u32 i) { block[i / w] |= 1LL << (i % w); }
bit_vector() {}
bit_vector(int _n) { init(_n); }
__attribute__((optimize("O3,unroll-loops"))) void init(int _n) {
n = zeros = _n;
block.resize(n / w + 1, 0);
count.resize(block.size(), 0);
}
__attribute__((target("popcnt"))) void build() {
for (u32 i = 1; i < block.size(); ++i)
count[i] = count[i - 1] + _mm_popcnt_u64(block[i - 1]);
zeros = rank0(n);
}
inline u32 rank0(u32 i) const { return i - rank1(i); }
__attribute__((target("bmi2,popcnt"))) inline u32 rank1(u32 i) const {
return count[i / w] + _mm_popcnt_u64(_bzhi_u64(block[i / w], i % w));
}
};
template <typename S, typename T>
struct WaveletMatrix {
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
struct BIT {
u32 N;
vector<T> data;
BIT() = default;
BIT(int size) { init(size); }
void init(int size) {
N = size;
data.assign(N + 1, 0);
}
__attribute__((target("bmi"))) void add(u32 k, T x) {
for (++k; k <= N; k += _blsi_u32(k)) data[k] += x;
}
__attribute__((target("bmi"))) T prod(u32 k) const {
T ret = T();
for (; k; k = _blsr_u32(k)) ret += data[k];
return ret;
}
__attribute__((target("bmi"))) T prod(int l, int r) const {
T ret = T();
while (l != r) {
if (l < r) {
ret += data[r];
r = _blsr_u32(r);
} else {
ret -= data[l];
l = _blsr_u32(l);
}
}
return ret;
}
};
using P = pair<S, S>;
int n, lg;
vector<bit_vector> bv;
vector<BIT> bit;
vector<P> ps;
vector<S> ys;
WaveletMatrix() {}
void add_point(S x, S y) {
ps.emplace_back(x, y);
ys.emplace_back(y);
}
__attribute__((optimize("O3"))) void build() {
sort(begin(ps), end(ps));
ps.erase(unique(begin(ps), end(ps)), end(ps));
n = ps.size();
sort(begin(ys), end(ys));
ys.erase(unique(begin(ys), end(ys)), end(ys));
vector<u32> cur(n), nxt(n);
for (int i = 0; i < n; ++i) cur[i] = yid(ps[i].second);
lg = __lg(max(n, 1)) + 1;
bv.assign(lg, n);
bit.assign(lg, n);
for (int h = lg - 1; h >= 0; --h) {
for (int i = 0; i < n; ++i)
if ((cur[i] >> h) & 1) bv[h].set(i);
bv[h].build();
array<decltype(begin(nxt)), 2> it{begin(nxt), begin(nxt) + bv[h].zeros};
for (int i = 0; i < n; ++i) *it[bv[h].get(i)]++ = cur[i];
swap(cur, nxt);
}
}
int xid(S x) const {
return lower_bound(
begin(ps), end(ps), make_pair(x, S()),
[](const P& a, const P& b) { return a.first < b.first; }) -
begin(ps);
}
int yid(S y) const { return lower_bound(begin(ys), end(ys), y) - begin(ys); }
void add(S x, S y, T val) {
int i = lower_bound(begin(ps), end(ps), P{x, y}) - begin(ps);
for (int h = lg - 1; h >= 0; --h) {
int i0 = bv[h].rank0(i);
if (bv[h].get(i))
i += bv[h].zeros - i0;
else
i = i0;
bit[h].add(i, val);
}
}
T prod(int l, int r, u32 upper) const {
T res = 0;
for (int h = lg; h--;) {
int l0 = bv[h].rank0(l), r0 = bv[h].rank0(r);
if ((upper >> h) & 1) {
res += bit[h].prod(l0, r0);
l += bv[h].zeros - l0;
r += bv[h].zeros - r0;
} else {
l = l0, r = r0;
}
}
return res;
}
//[L,R)×[D,U)
T prod(S L, S D, S R, S U) const {
int l = xid(L), r = xid(R);
return prod(l, r, yid(U)) - prod(l, r, yid(D));
}
};
#line 99 "main.cpp"
void solve() {
INT(n,q);
WaveletMatrix<int,int> WM;
WaveletMatrix<int,ll> WM2;
STR(s);
rep(i,n-2) {
int now = 0;
rep(j,3) {
now *= 26;
now += s[i+j] - 'a';
}
debug(i,now);
WM.add_point(i,now);
WM2.add_point(i,now);
}
string ts = s;
vvi query(q);
rep(i,q) {
INT(cmd);
if(cmd == 1) {
INT(k);
CHR(x);
k--;
query[i] = {1,k,x - 'a'};
ts[k] = x;
rep(j,3) {
int flg = 1;
int val = 0;
rep(l,k-j,k-j+3) {
if(!is_clamp(l,0,n)) {
flg = 0;
break;
}
val *= 26;
val += ts[l] - 'a';
}
if(flg) {
debug(val,1);
WM.add_point(k-j,val);
WM2.add_point(k-j,val);
}
}
}
else {
INT(l,r);
STR(a);
int val = 0;
rep(j,3) {
val *= 26;
val += a[j] - 'a';
}
debug(val,2);
l--;
query[i] = {2,l,r,val};
}
}
WM.build();
WM2.build();
rep(i,n-2) {
int now = 0;
rep(j,3) {
now *= 26;
now += s[i+j] - 'a';
}
debug(now);
WM.add(i,now,1);
WM2.add(i,now,i+1);
}
rep(i,q) {
if(query[i][0] == 1) {
int k = query[i][1];
rep(j,3) {
int flg = 1;
int val = 0;
rep(l,k-j,k-j+3) {
if(!is_clamp(l,0,n)) {
flg = 0;
break;
}
val *= 26;
val += s[l] - 'a';
}
if(flg) {
WM.add(k-j,val,-1);
WM2.add(k-j,val,-(k-j)-1);
}
}
s[k] = char('a' + query[i][2]);
rep(j,3) {
int flg = 1;
int val = 0;
rep(l,k-j,k-j+3) {
if(!is_clamp(l,0,n)) {
flg = 0;
break;
}
val *= 26;
val += s[l] - 'a';
}
if(flg) {
WM.add(k-j,val,1);
WM2.add(k-j,val,(k-j)+1);
}
}
}
else {
int l = query[i][1];
int r = query[i][2];
int v1 = WM.prod(l,query[i][3],r-2,query[i][3]+1);
ll v2 = WM2.prod(l,query[i][3],r-2,query[i][3]+1);
cout << v2 - 1LL * v1 * l << '\n';
}
}
}
int main() {
//INT(TT);
int TT = 1;
while(TT--) solve();
}