結果

問題 No.2992 Range ABCD String Query
ユーザー ecottea
提出日時 2024-12-17 00:06:07
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,014 ms / 6,000 ms
コード長 7,497 bytes
コンパイル時間 4,139 ms
コンパイル使用メモリ 271,068 KB
実行使用メモリ 53,620 KB
最終ジャッジ日時 2024-12-17 00:07:19
合計ジャッジ時間 29,964 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
//
/*
* S ∋ x = {v, c} : c v
* F ∋ f = b : f(x) = 0 x + b
* x op y : cx + cy vx + vy
* f act x : c c f
* f comp g : f o g
*/
// verify : https://atcoder.jp/contests/abc237/tasks/abc237_g
using T109 = ll;
using S109 = pair<array<array<int, 4>, 4>, int>; // (v, c)
using F109 = int; // (0, f; 0, 1)
S109 op109(S109 x, S109 y) {
S109 z;
rep(i, 4) rep(j, 4) z.first[i][j] = 0;
// dump("----"); dumpel(x.first); dump(""); dumpel(y.first); dump("");
rep(i, 4) repi(j, i, 3) {
chmax(z.first[i][j], x.first[i][j]);
chmax(z.first[i][j], y.first[i][j]);
repi(k, i, j) {
chmax(z.first[i][j], x.first[i][k] + y.first[k][j]);
}
}
z.second = x.second + y.second;
// dumpel(z.first);
return z;
}
S109 e109() {
S109 z;
rep(i, 4) rep(j, 4) z.first[i][j] = 0;
z.second = 0;
return z;
}
F109 id109() {
return INF + 1;
} // 使 OK
S109 act109(F109 f, S109 x) {
if (f == id109()) return x;
rep(i, 4) rep(j, 4) {
if (i <= f && j >= f) x.first[i][j] = x.second;
else x.first[i][j] = 0;
}
return x;
}
F109 comp109(F109 f, F109 g) {
if (f == id109()) return g;
// (0, f; 0, 1).(0, g; 0, 1) = (0, f; 0, 1)
return f;
}
#define Update_Sum_mmonoid S109, op109, e109, F109, act109, comp109, id109
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n, q;
cin >> n >> q;
string s;
cin >> s;
vi a(n);
rep(i, n) a[i] = s[i] - 'A';
vector<S109> ini(n);
rep(t, n) {
rep(i, 4) rep(j, 4) {
if (i <= a[t] && j >= a[t]) ini[t].first[i][j] = 1;
else ini[t].first[i][j] = 0;
}
ini[t].second = 1;
}
lazy_segtree<Update_Sum_mmonoid> seg(ini);
//auto [mat, len] = seg.prod(0, 3);
//dumpel(mat);
//exit(0);
rep(hoge, q) {
int tp;
cin >> tp;
if (tp == 2) {
int l, r;
cin >> l >> r;
l--;
auto [mat, len] = seg.prod(l, r);
dumpel(mat);
int res = 0;
rep(i, 4) repi(j, i, 3) chmax(res, mat[i][j]);
cout << (r - l) - res << "\n";
}
else {
int x; char c;
cin >> x >> c;
x--;
seg.apply(x, x + 1, c - 'A');
}
dump(seg);
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0