結果

問題 No.2901 Logical Sum of Substring
ユーザー hitonanodehitonanode
提出日時 2024-09-20 22:43:25
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 12,941 bytes
コンパイル時間 2,464 ms
コンパイル使用メモリ 202,940 KB
実行使用メモリ 9,472 KB
最終ジャッジ日時 2024-09-20 22:43:50
合計ジャッジ時間 21,856 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 7 ms
6,944 KB
testcase_03 AC 6 ms
6,944 KB
testcase_04 AC 6 ms
6,940 KB
testcase_05 AC 6 ms
6,940 KB
testcase_06 AC 6 ms
6,944 KB
testcase_07 AC 6 ms
6,940 KB
testcase_08 AC 622 ms
9,344 KB
testcase_09 AC 622 ms
9,472 KB
testcase_10 AC 613 ms
9,472 KB
testcase_11 AC 647 ms
9,344 KB
testcase_12 AC 613 ms
9,472 KB
testcase_13 AC 644 ms
9,344 KB
testcase_14 AC 1,116 ms
9,472 KB
testcase_15 AC 1,112 ms
9,472 KB
testcase_16 AC 1,111 ms
9,344 KB
testcase_17 AC 136 ms
9,344 KB
testcase_18 AC 142 ms
9,344 KB
testcase_19 AC 140 ms
9,472 KB
testcase_20 AC 644 ms
9,472 KB
testcase_21 AC 615 ms
9,344 KB
testcase_22 AC 636 ms
9,344 KB
testcase_23 AC 136 ms
9,472 KB
testcase_24 AC 142 ms
9,472 KB
testcase_25 AC 141 ms
9,344 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 651 ms
9,344 KB
testcase_30 AC 626 ms
9,472 KB
testcase_31 AC 630 ms
9,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


#include <atcoder/segtree>

constexpr int inf = 1 << 29;

int op(int l, int r) { return l | r; }
int e() { return 0; }

int opmin(int l, int r) { return min(l, r); }
int emin() { return inf; }

#include <cassert>
#include <cstdint>
#include <vector>

// Sorted set of integers [0, n)
// Space complexity: (64 / 63) n + O(log n) bit
class fast_set {
    static constexpr int B = 64;

    int n;
    int cnt;
    std::vector<std::vector<uint64_t>> _d;

    static int bsf(uint64_t x) { return __builtin_ctzll(x); }
    static int bsr(uint64_t x) { return 63 - __builtin_clzll(x); }

public:
    // 0 以上 n_ 未満の整数が入れられる sorted set を作成
    fast_set(int n_) : n(n_), cnt(0) {
        do { n_ = (n_ + B - 1) / B, _d.push_back(std::vector<uint64_t>(n_)); } while (n_ > 1);
    }

    bool contains(int i) const {
        assert(0 <= i and i < n);
        return (_d.front().at(i / B) >> (i % B)) & 1;
    }

    void insert(int i) {
        assert(0 <= i and i < n);
        if (contains(i)) return;
        ++cnt;
        for (auto &vec : _d) {
            bool f = vec.at(i / B);
            vec.at(i / B) |= 1ULL << (i % B), i /= B;
            if (f) break;
        }
    }

    void erase(int i) {
        assert(0 <= i and i < n);
        if (!contains(i)) return;
        --cnt;
        for (auto &vec : _d) {
            vec.at(i / B) &= ~(1ULL << (i % B)), i /= B;
            if (vec.at(i)) break;
        }
    }

    // i 以上の最小要素 なければ default_val
    int next(int i, const int default_val) const {
        assert(0 <= i and i <= n);

        for (auto itr = _d.cbegin(); itr != _d.cend(); ++itr, i = i / B + 1) {
            if (i / B >= int(itr->size())) break;

            if (auto d = itr->at(i / B) >> (i % B); d) {
                i += bsf(d);
                while (itr != _d.cbegin()) i = i * B + bsf((--itr)->at(i));
                return i;
            }
        }

        return default_val;
    }
    int next(const int i) const { return next(i, n); }

    // i 以下の最小要素 なければ default_val
    int prev(int i, int default_val = -1) const {
        assert(-1 <= i and i < n);

        for (auto itr = _d.cbegin(); itr != _d.cend() and i >= 0; ++itr, i = i / B - 1) {
            if (auto d = itr->at(i / B) << (B - 1 - i % B); d) {
                i += bsr(d) - (B - 1);
                while (itr != _d.cbegin()) i = i * B + bsr((--itr)->at(i));
                return i;
            }
        }

        return default_val;
    }

    // return minimum element (if exists) or `n` (empty)
    int min() const { return next(0); }
    // return maximum element (if exists) or `-1` (empty)
    int max() const { return prev(n - 1); }
    int size() const { return cnt; }
    bool empty() const { return cnt == 0; }

    void clear() {
        if (!cnt) return;
        cnt = 0;
        auto rec = [&](auto &&self, int d, int x) -> void {
            if (d) {
                for (auto m = _d.at(d).at(x); m;) {
                    int i = bsf(m);
                    m -= 1ULL << i, self(self, d - 1, x * B + i);
                }
            }
            _d.at(d).at(x) = 0;
        };
        rec(rec, _d.size() - 1, 0);
    }
};


int main() {
    int N, K;
    cin >> N >> K;
    const int full = (1 << K) - 1;
    vector<int> A(N);
    cin >> A;
    dbg(A);

    vector fss(K, fast_set(N));

    int Q;
    cin >> Q;
    vector<tuple<int, int, int>> qs(Q);

    constexpr int U = 500;

    atcoder::segtree<int, op, e> seg_a(A);
    atcoder::segtree<int, opmin, emin> seg_min((vector<int>(N, emin())));

    auto set_i = [&](int i) {
        REP(d, K) {
            if ((A.at(i) >> d) & 1) {
                fss.at(d).insert(i);
            } else {
                fss.at(d).erase(i);
            }
        }

        int w = seg_a.max_right(i, [&](int x) { return x < full; }) - i + 1;
        if (i + w > N) w = emin();
        seg_min.set(i, w);
    };

    REP(i, N) {
        set_i(i);
        dbg(make_tuple(i, seg_min.get(i)));
    }

    // vector<int> xs{0, N};
    for (auto &[tp, l, r] : qs) {
        cin >> tp >> l >> r;
        --l;

        if (tp == 1) {
            seg_a.set(l, r);
            FOR(i, l - U, l + 1) {
                if (i < 0) continue;
                A.at(i) = r;
                set_i(i);
                dbg(make_tuple(i, seg_min.get(i)));
            }
        } else {
            dbg(make_tuple(l, r));
            const int w = r - l;
            int tmp = emin();
            if (w >= U) {
                chmin(tmp, seg_min.prod(l, r - U));
            }
            FOR(i, r - U, r) {
                if (i >= l) {
                    int w2 = seg_min.get(i);
                    if (w2 <= U and i + w2 <= r) chmin(tmp, w2);
                }
            }
            if (tmp <= U) {
                cout << tmp << '\n';
            } else {
                tmp = inf;
                for (int c = l + U; c < r; c += U) {
                    REP(k, K) {
                        int i = fss.at(k).prev(c - 1, -1);
                        if (i >= 0) {
                            int rr = seg_a.max_right(i, [&](int x) { return x < full; });
                            if (rr <= r) chmin(tmp, rr - i + 1);
                            // chmin(tmp, )
                        }
                    }
                }

                if (tmp == inf) tmp = -1;
                cout << tmp << '\n';
            }
        }
    }

    // xs = sort_unique(xs);
    // dbg(xs);

    // vector<int> belong_to(N + 1);
    // for (int x : xs) {
    //     if (x != 0) belong_to.at(x)++;
    // }
    // FOR(i, 1, belong_to.size()) belong_to.at(i) += belong_to.at(i - 1);
    // dbg(belong_to);

    // const int M = xs.size() - 1;
    // assert(belong_to.back() == M);

    // vector cntr(M, vector<int>(K));

    // REP(i, N) {
    //     REP(d, K) cntr.at(belong_to.at(i)).at(d) += (A.at(i) >> d) & 1;
    // }

    // for (auto [tp, l, r] : qs) {
    //     if (tp == 1) {
    //         const int i = l;
    //         int g = belong_to.at(i);
    //         REP(d, K) cntr.at(g).at(d) -= (A.at(i) >> d) & 1;
    //         A.at(i) = r;
    //         REP(d, K) cntr.at(g).at(d) += (A.at(i) >> d) & 1;
    //     } else {
    //         l = belong_to.at(l), r = belong_to.at(r);
    //     }
    // }
}
0