#1031894 (C++23) No.2992 Range ABCD String Query

提出ソース

結果

問題	No.2992 Range ABCD String Query
ユーザー	noya2
提出日時	2024-12-17 01:04:41
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	556 ms / 6,000 ms
コード長	8,267 bytes
コンパイル時間	3,661 ms
コンパイル使用メモリ	255,268 KB
実行使用メモリ	48,868 KB
最終ジャッジ日時	2024-12-17 01:05:06
合計ジャッジ時間	20,093 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	111 ms 6,820 KB
testcase_01	AC	108 ms 6,820 KB
testcase_02	AC	142 ms 6,816 KB
testcase_03	AC	126 ms 6,816 KB
testcase_04	AC	153 ms 6,820 KB
testcase_05	AC	120 ms 6,816 KB
testcase_06	AC	139 ms 6,820 KB
testcase_07	AC	79 ms 6,816 KB
testcase_08	AC	177 ms 6,816 KB
testcase_09	AC	123 ms 6,824 KB
testcase_10	AC	480 ms 47,312 KB
testcase_11	AC	502 ms 46,708 KB
testcase_12	AC	556 ms 46,920 KB
testcase_13	AC	475 ms 45,168 KB
testcase_14	AC	524 ms 44,556 KB
testcase_15	AC	482 ms 44,848 KB
testcase_16	AC	470 ms 27,352 KB
testcase_17	AC	494 ms 48,404 KB
testcase_18	AC	486 ms 44,508 KB
testcase_19	AC	536 ms 48,708 KB
testcase_20	AC	342 ms 48,832 KB
testcase_21	AC	344 ms 48,808 KB
testcase_22	AC	373 ms 48,660 KB
testcase_23	AC	353 ms 48,804 KB
testcase_24	AC	347 ms 48,868 KB
testcase_25	AC	507 ms 48,772 KB
testcase_26	AC	485 ms 48,852 KB
testcase_27	AC	498 ms 48,724 KB
testcase_28	AC	469 ms 48,784 KB
testcase_29	AC	479 ms 48,784 KB
testcase_30	AC	487 ms 48,824 KB
testcase_31	AC	491 ms 48,840 KB
testcase_32	AC	458 ms 48,772 KB
testcase_33	AC	489 ms 48,724 KB
testcase_34	AC	458 ms 48,808 KB
testcase_35	AC	477 ms 48,664 KB
testcase_36	AC	450 ms 48,684 KB
testcase_37	AC	55 ms 6,816 KB
testcase_38	AC	65 ms 6,816 KB
testcase_39	AC	81 ms 6,816 KB
testcase_40	AC	80 ms 6,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp"

namespace noya2{

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = 0;
        size = 1;
        while (size < _n) size <<= 1, log++;

        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

} // namespace noya2
#line 4 "c.cpp"
using ar = array<array<int,4>,4>;

ar arinf = {};

ar op(ar a, ar b){
    ar c = arinf;
    rep(i,4) rep(j,4) rep(k,4) {
        chmin(c[i][k],a[i][j]+b[j][k]);
    }
    return c;
}

void init(){
    rep(i,4) rep(j,4) arinf[i][j] = iinf;
}

ar e(){
    return {};
}

ar val(char c){
    int id = c - 'A';
    ar f = arinf;
    rep(i,4) rep(j,4){
        if (i <= id && id <= j){
            chmin(f[i][j],0);
        }
        else if (i <= j){
            chmin(f[i][j],1);
        }
    }
    return f;
}

void solve(){
    init();
    int n, q; in(n,q);
    string s; in(s);
    segtree<ar,op,e> seg([&]{
        vector<ar> a(n);
        rep(i,n){
            a[i] = val(s[i]);
        }
        return a;
    }());
    while (q--){
        int t; in(t);
        if (t == 1){
            int p; in(p); p--;
            char c; in(c);
            seg.set(p,val(c));
        }
        if (t == 2){
            int l, r; in(l,r); l--;
            out(seg.prod(l,r)[0][3]);
        }
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}

yukicoder

結果

テストケース

ソースコード