結果

問題 No.2901 Logical Sum of Substring
ユーザー noya2noya2
提出日時 2024-09-20 23:12:46
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 330 ms / 3,000 ms
コード長 10,304 bytes
コンパイル時間 3,551 ms
コンパイル使用メモリ 256,276 KB
実行使用メモリ 204,928 KB
最終ジャッジ日時 2024-09-20 23:13:00
合計ジャッジ時間 12,030 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 4 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 4 ms
5,376 KB
testcase_06 AC 4 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 290 ms
204,928 KB
testcase_09 AC 315 ms
204,800 KB
testcase_10 AC 289 ms
204,928 KB
testcase_11 AC 301 ms
204,800 KB
testcase_12 AC 305 ms
204,800 KB
testcase_13 AC 296 ms
204,928 KB
testcase_14 AC 316 ms
204,800 KB
testcase_15 AC 311 ms
204,800 KB
testcase_16 AC 307 ms
204,928 KB
testcase_17 AC 298 ms
204,800 KB
testcase_18 AC 325 ms
204,800 KB
testcase_19 AC 305 ms
204,800 KB
testcase_20 AC 295 ms
204,800 KB
testcase_21 AC 301 ms
204,928 KB
testcase_22 AC 330 ms
204,800 KB
testcase_23 AC 295 ms
204,928 KB
testcase_24 AC 294 ms
204,800 KB
testcase_25 AC 296 ms
204,800 KB
testcase_26 AC 308 ms
204,928 KB
testcase_27 AC 291 ms
204,928 KB
testcase_28 AC 293 ms
204,800 KB
testcase_29 AC 287 ms
204,928 KB
testcase_30 AC 283 ms
204,800 KB
testcase_31 AC 314 ms
204,928 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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"

const int mx = 17;
using ar = array<pii,mx>;
ar ar0 = {};
int valid;

struct S {
    ar lch, rch;
    int tor;
    int mi;
    int len;
};

S op(S a, S b){
    S c;
    c.tor = a.tor | b.tor;
    c.mi = min(a.mi,b.mi);
    c.len = a.len + b.len;
    c.lch = c.rch = ar0;
    // mid 
    {
        int ia = 0;
        rep(i,mx){
            if (a.rch[ia].first == -1) break;
            ia++;
        }
        ia--;
        int ib = 0;
        while (ia >= 0){
            while (ib < mx && b.lch[ib].first != -1 && (a.rch[ia].first | b.lch[ib].first) != valid){
                ib++;
            }
            if (ib == mx || b.lch[ib].first == -1) break;
            chmin(c.mi,a.rch[ia].second+b.lch[ib].second);
            ia--;
        }
    }
    // l
    {
        rep(i,mx){
            b.lch[i].first |= a.tor;
        }
        int id = 1;
        int cur = 0;
        rep(i,mx){
            if (a.lch[i].first == -1) break;
            if (cur == a.lch[i].first) continue;
            cur = a.lch[i].first;
            c.lch[id] = {cur, a.lch[i].second};
            id++;
        }
        rep(i,mx){
            if (b.lch[i].first == -1) break;
            if (cur == b.lch[i].first) continue;
            cur = b.lch[i].first;
            c.lch[id] = {cur, b.lch[i].second + a.len};
            id++;
        }
        assert(id <= mx);
    }
    // r
    {
        rep(i,mx){
            a.rch[i].first |= b.tor;
        }
        int id = 1;
        int cur = 0;
        rep(i,mx){
            if (b.rch[i].first == -1) break;
            if (cur == b.rch[i].first) continue;
            cur = b.rch[i].first;
            c.rch[id] = {cur, b.rch[i].second};
            id++;
        }
        rep(i,mx){
            if (a.rch[i].first == -1) break;
            if (cur == a.rch[i].first) continue;
            cur = a.rch[i].first;
            c.rch[id] = {cur, a.rch[i].second + b.len};
            id++;
        }
        assert(id <= mx);
    }
    return c;
}

S e(){
    return S{ar0,ar0,0,iinf,0};
}

void solve(){
    rep(i,mx){
        ar0[i] = {-1,-1};
    }
    ar0[0] = {0,0};
    int n; in(n);
    int k; in(k);
    valid = (1<<k)-1;
    vector<int> a(n); in(a);
    auto val = [&](int x){
        S v = e();
        if (x != 0){
            v.lch[1] = {x,1};
            v.rch[1] = {x,1};
        }
        if (x == valid){
            chmin(v.mi,1);
        }
        v.tor = x;
        v.len = 1;
        return v;
    };
    segtree<S,op,e> seg([&]{
        vector<S> b(n);
        rep(i,n){
            b[i] = val(a[i]);
        }
        return b;
    }());
    int q; in(q);
    while (q--){
        int t; in(t);
        if (t == 1){
            int i; in(i); i--;
            int x; in(x);
            seg.set(i,val(x));
        }
        if (t == 2){
            int l, r; in(l,r); l--;
            // auto dp = seg.prod(l,r);
            // out(dp.mi,dp.len,dp.tor);
            auto ans = seg.prod(l,r).mi;
            if (ans == iinf) ans = -1;
            out(ans);
        }
    }
}

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