結果
問題 | No.2992 Range ABCD String Query |
ユーザー |
|
提出日時 | 2024-12-17 03:27:33 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 728 ms / 6,000 ms |
コード長 | 4,214 bytes |
コンパイル時間 | 10,029 ms |
コンパイル使用メモリ | 453,520 KB |
実行使用メモリ | 94,148 KB |
最終ジャッジ日時 | 2024-12-17 03:28:09 |
合計ジャッジ時間 | 30,756 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 41 |
ソースコード
#include "bits/stdc++.h" #include <stdio.h> #include <math.h> #include "atcoder/all" #include <float.h> #include <boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) #define TCASE() ll _ttt; cin >> _ttt; while(_ttt--) using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; #define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x; #define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x; #define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init); using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template <class T = long long> using pql = priority_queue<T>; template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>; using vm = vector<mint>; using vvm = vector<vm>; ostream& operator<<(ostream& os, const mint& v) { os << v.val(); return os; } void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; }; template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 auto gmax(const auto& a, const auto& b) { return a > b ? a : b; }; auto gmin(const auto& a, const auto& b) { return a < b ? a : b; }; bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; } bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; } void sort(auto& v) { std::ranges::sort(v); }; void rev(auto& v) { std::ranges::reverse(v); }; template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; }; template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); } long long ceil(const long long a, const long long b) { return (a + b - 1) / b; } using sd = array<array<ll, 4>, 4>; //セグ木(max) sd op(sd a, sd b) { sd r; REP(i, 4) REPI(j, i, 4) { ll v = llhuge; REPI(k, i, j+1) { chmin(v, a[i][k] + b[k][j]); } r[i][j] = v; } return r; } sd init() { sd ret; REP(i, 4) REPI(j, i, 4) { ret[i][j] = 0; } return ret; } sd e() { return init(); } using st = segtree<sd, op, e>; ll sdmin(const sd& a) { ll ret = llhuge; REP(i, 4) REPI(j, i, 4) { chmin(ret, a[i][j]); } return ret; } sd sdval(const char c) { sd ret; ll v = c - 'A'; REP(i, 4) REPI(j, i, 4) { if (i <= v && v <= j) ret[i][j] = 0; else ret[i][j] = 1; } return ret; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n, q; cin >> n >> q; string s; cin >> s; vector init(n, sd()); REP(i, n) init[i] = sdval(s[i]); st seg(init); REP(i, q) { ll t; cin >> t; if (t == 1) { ll x; char c; cin >> x >> c; seg.set(x - 1, sdval(c)); } else { ll l, r; cin >> l >> r; cout << sdmin(seg.prod(l - 1, r)) << endl; } } return 0; }