結果
| 問題 | No.2992 Range ABCD String Query |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2024-12-17 00:10:22 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 622 ms / 6,000 ms |
| コード長 | 15,460 bytes |
| コンパイル時間 | 2,792 ms |
| コンパイル使用メモリ | 220,332 KB |
| 最終ジャッジ日時 | 2025-02-26 14:56:50 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 41 |
ソースコード
//#define _GLIBCXX_DEBUG//#pragma GCC target("avx2")//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>using namespace std;#ifdef LOCAL#include <debug_print.hpp>#define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else#define OUT(...) (static_cast<void>(0))#endif#define endl '\n'#define lfs cout<<fixed<<setprecision(15)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)namespace template_tute{using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 4.1e18;using P = pair<ll, ll>;template<typename T> using PQ = priority_queue<T>;template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max<ll>({a,b,c})-min<ll>({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};template<typename T>void debug(const vector<T>&v){debug(v,v.size());}template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << "(" << p.first << "," << p.second << ")";}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){os<<"[";for(auto &z:v)os << z << ",";os<<"]"; return os;}template<typename T>void rearrange(vector<int>&ord, vector<T>&v){auto tmp = v;for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];}template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){rearrange(ord, head);rearrange(ord, tail...);}template<typename T> vector<int> ascend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});return ord;}template<typename T> vector<int> descend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});return ord;}template<typename T> vector<T> inv_perm(const vector<T>&ord){vector<T>inv(ord.size());for(int i=0;i<ord.size();i++)inv[ord[i]] = i;return inv;}ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}ll modulo(ll n,ll d){return (n%d+d)%d;};template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}std::ostream &operator<<(std::ostream &dest, __int128_t value) {std::ostream::sentry s(dest);if (s) {__uint128_t tmp = value < 0 ? -value : value;char buffer[128];char *d = std::end(buffer);do {--d;*d = "0123456789"[tmp % 10];tmp /= 10;} while (tmp != 0);if (value < 0) {--d;*d = '-';}int len = std::end(buffer) - d;if (dest.rdbuf()->sputn(d, len) != len) {dest.setstate(std::ios_base::badbit);}}return dest;}namespace converter{int dict[500];const string lower="abcdefghijklmnopqrstuvwxyz";const string upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string digit="0123456789";const string digit1="123456789";void regi_str(const string &t){for(int i=0;i<t.size();i++){dict[t[i]]=i;}}void regi_int(const string &t){for(int i=0;i<t.size();i++){dict[i]=t[i];}}vector<int>to_int(const string &s,const string &t){regi_str(t);vector<int>ret(s.size());for(int i=0;i<s.size();i++){ret[i]=dict[s[i]];}return ret;}vector<int>to_int(const string &s){auto t=s;sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());return to_int(s,t);}vector<vector<int>>to_int(const vector<string>&s,const string &t){regi_str(t);vector<vector<int>>ret(s.size(),vector<int>(s[0].size()));for(int i=0;i<s.size();i++){for(int j=0;j<s[0].size();j++){ret[i][j]=dict[s[i][j]];}}return ret;}vector<vector<int>>to_int(const vector<string>&s){string t;for(int i=0;i<s.size();i++){t+=s[i];}sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());return to_int(s,t);}string to_str(const vector<int>&s,const string &t){regi_int(t);string ret;for(auto z:s)ret+=dict[z];return ret;}vector<string> to_str(const vector<vector<int>>&s,const string &t){regi_int(t);vector<string>ret(s.size());for(int i=0;i<s.size();i++){for(auto z:s[i])ret[i]+=dict[z];}return ret;}}template< typename T = int >struct edge {int to;T cost;int id;edge():to(-1),id(-1){};edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}operator int() const { return to; }};template<typename T>using Graph = vector<vector<edge<T>>>;template<typename T>Graph<T>revgraph(const Graph<T> &g){Graph<T>ret(g.size());for(int i=0;i<g.size();i++){for(auto e:g[i]){int to = e.to;e.to = i;ret[to].push_back(e);}}return ret;}template<typename T>Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){Graph<T> ret(n);for(int es = 0; es < m; es++){int u,v;T w=1;cin>>u>>v;u-=indexed,v-=indexed;if(weighted)cin>>w;ret[u].emplace_back(v,w,es);if(!directed)ret[v].emplace_back(u,w,es);}return ret;}template<typename T>Graph<T> readParent(int n,int indexed=1,bool directed=true){Graph<T>ret(n);for(int i=1;i<n;i++){int p;cin>>p;p-=indexed;ret[p].emplace_back(i);if(!directed)ret[i].emplace_back(p);}return ret;}}using namespace template_tute;template< class T , int maxsize>struct SquareMatrix {using arr = array <T, maxsize>;using sqmat = array <arr, maxsize>;sqmat A;ll n;const T iden = 0;//mulの単位元const T zero = INF;//addの単位元const T add(T x, T y){return min(x,y);}const T mul(T x, T y){return x+y;}sqmat zeros(){sqmat mat;for(ll i=0;i<maxsize;i++)for(ll j=0;j<maxsize;j++)mat[i][j]=zero;return mat;}SquareMatrix() {n = maxsize;A = zeros();}SquareMatrix(size_t N) : n(N){A = zeros();};SquareMatrix(vector<vector<T>>v):n(v.size()){for(ll i=0;i<n;i++)for(ll j=0;j<n;j++)A[i][j]=v[i][j];};inline const arr &operator[](int k) const {return (A[k]);}inline arr &operator[](int k) {return (A[k]);}static SquareMatrix I(size_t N){SquareMatrix mat(N);for(int i = 0; i < N; i++) mat[i][i] = mat.iden;return (mat);}SquareMatrix &operator+=(const SquareMatrix &B) {for(int i = 0; i < n; i++)for(int j = 0; j < n; j++)(*this)[i][j] = add((*this)[i][j], B[i][j]);return (*this);}SquareMatrix &operator*=(const SquareMatrix &B) {sqmat C = zeros();for(int i = 0; i < n; i++)for(int j = 0; j < n; j++)for(int k = 0; k < n; k++)C[i][j] = add(C[i][j],mul((*this)[i][k] , B[k][j]));A.swap(C);return (*this);}SquareMatrix &operator^=(long long k) {SquareMatrix B = SquareMatrix::I(n);while(k > 0) {if(k & 1) B *= *this;*this *= *this;k >>= 1LL;}A.swap(B.A);return (*this);}SquareMatrix operator+(const SquareMatrix &B) const {return (SquareMatrix(*this) += B);}SquareMatrix operator*(const SquareMatrix &B) const {return (SquareMatrix(*this) *= B);}SquareMatrix operator^(const long long k) const {return (SquareMatrix(*this) ^= k);}bool operator==(const SquareMatrix &B)const{return this->A == B.A;}bool operator!=(const SquareMatrix &B)const{return this->A != B.A;}SquareMatrix& operator=(const SquareMatrix &b){this->n=b.n;this->A=b.A;return *this;}friend ostream &operator<<(ostream &os, SquareMatrix p) {for(int i = 0; i < p.n; i++) {os << "[";for(int j = 0; j < p.n; j++) {os << p[i][j] << (j + 1 == p.n ? "]\n" : ",");}}return (os);}};template< typename Monoid ,typename F>struct SegmentTree {int sz, n;vector< Monoid > seg;const F f;const Monoid M1;SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), n(n){sz = 1;while(sz < n) sz <<= 1;seg.assign(2 * sz, M1);}void set(int k, const Monoid &x) {seg[k + sz] = x;}void build() {for(int k = sz - 1; k > 0; k--) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}void update(int k, const Monoid &x) {k += sz;seg[k] = x;while(k >>= 1) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}Monoid query(int a, int b) {if(a>=b)return M1;Monoid L = M1, R = M1;for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if(a & 1) L = f(L, seg[a++]);if(b & 1) R = f(seg[--b], R);}return f(L, R);}Monoid operator[](const int &k) const {return seg[k + sz];}template< typename C >int find_subtree(int a, const C &check, Monoid &M, bool type) {while(a < sz) {Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);if(check(nxt)) a = 2 * a + type;else M = nxt, a = 2 * a + 1 - type;}return a - sz;}//[a,x]が条件を満たす最初のx,満たさなければntemplate< typename C >int find_first(int a, const C &check) {Monoid L = M1;if(a <= 0) {if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);return n;}int b = sz;for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if(a & 1) {Monoid nxt = f(L, seg[a]);if(check(nxt)) return find_subtree(a, check, L, false);L = nxt;++a;}}return n;}//[x,b)が条件を満たす最後のx,満たさなければ-1template< typename C >int find_last(int b, const C &check) {Monoid R = M1;if(b >= sz) {if(check(f(seg[1], R))) return find_subtree(1, check, R, true);return -1;}int a = sz;for(b += sz; a < b; a >>= 1, b >>= 1) {if(b & 1) {Monoid nxt = f(seg[--b], R);if(check(nxt)) return find_subtree(b, check, R, true);R = nxt;}}return -1;}void print(){for(ll i=0;i<n;i++)if((*this)[i]==M1)cout<<"x ";else cout<<(*this)[i]<<" ";cout<<endl;}};void solve(){ll res=0,buf=0;bool judge = true;using SQ=SquareMatrix<ll,4>;auto f=[&](SQ x,SQ y){return x*y;};ll n,q;cin>>n>>q;SegmentTree seg(n,f,SQ::I(4));string s;cin>>s;auto get=[&](char c){ll k=c-'A';SQ ret(4);rep(i,0,4)rep(j,i,4){if(j!=k)ret[i][j]=1;else ret[i][j]=0;}return ret;};rep(i,0,n){seg.set(i,get(s[i]));}seg.build();while(q--){ll t;cin>>t;if(t==1){ll x;cin>>x;char c;cin>>c;x--;seg.update(x,get(c));}else{ll l,r;cin>>l>>r;l--;auto mat=seg.query(l,r);ll ret=INF;rep(i,0,4)rep(j,i,4){chmin(ret,mat[i][j]);}cout<<ret<<endl;}}}int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;int T = 1;//cin>>T;while(T--){solve();}return 0;}