結果

問題 No.2809 Sort Query
ユーザー tokusakuraitokusakurai
提出日時 2024-07-12 22:16:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 661 ms / 2,000 ms
コード長 7,047 bytes
コンパイル時間 2,716 ms
コンパイル使用メモリ 220,212 KB
実行使用メモリ 33,728 KB
最終ジャッジ日時 2024-07-12 22:16:51
合計ジャッジ時間 43,224 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 455 ms
31,332 KB
testcase_02 AC 424 ms
31,320 KB
testcase_03 AC 351 ms
31,680 KB
testcase_04 AC 381 ms
31,428 KB
testcase_05 AC 369 ms
31,756 KB
testcase_06 AC 271 ms
30,188 KB
testcase_07 AC 271 ms
30,148 KB
testcase_08 AC 270 ms
30,196 KB
testcase_09 AC 293 ms
30,116 KB
testcase_10 AC 267 ms
30,168 KB
testcase_11 AC 480 ms
31,352 KB
testcase_12 AC 527 ms
31,420 KB
testcase_13 AC 489 ms
31,228 KB
testcase_14 AC 486 ms
31,396 KB
testcase_15 AC 501 ms
31,396 KB
testcase_16 AC 469 ms
31,308 KB
testcase_17 AC 494 ms
31,292 KB
testcase_18 AC 474 ms
31,308 KB
testcase_19 AC 470 ms
31,376 KB
testcase_20 AC 501 ms
31,384 KB
testcase_21 AC 630 ms
33,672 KB
testcase_22 AC 623 ms
33,728 KB
testcase_23 AC 659 ms
33,656 KB
testcase_24 AC 635 ms
33,708 KB
testcase_25 AC 661 ms
33,728 KB
testcase_26 AC 543 ms
31,912 KB
testcase_27 AC 544 ms
32,004 KB
testcase_28 AC 573 ms
31,916 KB
testcase_29 AC 541 ms
31,908 KB
testcase_30 AC 543 ms
31,944 KB
testcase_31 AC 381 ms
30,520 KB
testcase_32 AC 382 ms
30,180 KB
testcase_33 AC 399 ms
30,176 KB
testcase_34 AC 363 ms
30,828 KB
testcase_35 AC 355 ms
30,160 KB
testcase_36 AC 416 ms
31,324 KB
testcase_37 AC 427 ms
31,316 KB
testcase_38 AC 462 ms
31,336 KB
testcase_39 AC 427 ms
31,348 KB
testcase_40 AC 456 ms
31,320 KB
testcase_41 AC 433 ms
30,140 KB
testcase_42 AC 371 ms
30,140 KB
testcase_43 AC 402 ms
30,144 KB
testcase_44 AC 377 ms
30,136 KB
testcase_45 AC 405 ms
30,128 KB
testcase_46 AC 380 ms
30,136 KB
testcase_47 AC 316 ms
30,140 KB
testcase_48 AC 338 ms
30,140 KB
testcase_49 AC 312 ms
30,184 KB
testcase_50 AC 344 ms
30,140 KB
testcase_51 AC 594 ms
30,144 KB
testcase_52 AC 512 ms
30,144 KB
testcase_53 AC 491 ms
30,008 KB
testcase_54 AC 535 ms
30,016 KB
testcase_55 AC 541 ms
30,140 KB
testcase_56 AC 258 ms
21,768 KB
testcase_57 AC 208 ms
18,080 KB
testcase_58 AC 204 ms
17,988 KB
testcase_59 AC 206 ms
17,672 KB
testcase_60 AC 277 ms
23,968 KB
testcase_61 AC 350 ms
28,948 KB
testcase_62 AC 204 ms
18,176 KB
testcase_63 AC 308 ms
22,756 KB
testcase_64 AC 362 ms
29,912 KB
testcase_65 AC 209 ms
19,844 KB
testcase_66 AC 2 ms
6,944 KB
testcase_67 AC 2 ms
6,944 KB
testcase_68 AC 2 ms
6,944 KB
testcase_69 AC 2 ms
6,940 KB
testcase_70 AC 1 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r) - 1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

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

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

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
void err_print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cerr << v[i] + x << ' ';
    cerr << endl;
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

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

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

template <typename T>
struct Binary_Indexed_Tree {
    vector<T> bit;
    const int n;

    Binary_Indexed_Tree(const vector<T> &v) : n((int)v.size()) {
        bit.resize(n + 1);
        copy(begin(v), end(v), begin(bit) + 1);
        build();
    }

    Binary_Indexed_Tree(int n, T x = 0) : Binary_Indexed_Tree(vector<T>(n, x)) {}

    void set(int i, const T &x) { bit[i + 1] = x; }

    void build() {
        for (int a = 2; a <= n; a <<= 1) {
            for (int b = a; b <= n; b += a) bit[b] += bit[b - a / 2];
        }
    }

    void add(int i, const T &x) {
        for (i++; i <= n; i += (i & -i)) bit[i] += x;
    }

    void change(int i, const T &x) { add(i, x - query(i, i + 1)); }

    T sum(int i) const {
        i = min(i, n);
        if (i <= 0) return 0;
        T ret = 0;
        for (; i > 0; i -= (i & -i)) ret += bit[i];
        return ret;
    }

    T query(int l, int r) const {
        l = max(l, 0), r = min(r, n);
        if (l >= r) return 0;
        return sum(r) - sum(l);
    }

    T operator[](int i) const { return query(i, i + 1); }

    // v[0]+...+v[r] >= x を満たす最小の r (なければ n)
    int lower_bound(T x) const {
        int ret = 0;
        for (int k = 31 - __builtin_clz(n); k >= 0; k--) {
            if (ret + (1 << k) <= n && bit[ret + (1 << k)] < x) x -= bit[ret += (1 << k)];
        }
        return ret;
    }

    // v[0]+...+v[r] > x を満たす最小の r (なければ n)
    int upper_bound(T x) const {
        int ret = 0;
        for (int k = 31 - __builtin_clz(n); k >= 0; k--) {
            if (ret + (1 << k) <= n && bit[ret + (1 << k)] <= x) x -= bit[ret += (1 << k)];
        }
        return ret;
    }
};

void solve() {
    int N, Q;
    cin >> N >> Q;

    vector<ll> a(N);
    rep(i, N) cin >> a[i];

    auto xs = a;

    vector<ll> t(Q), k(Q), x(Q);
    rep(i, Q) {
        cin >> t[i];
        if (t[i] == 1) {
            cin >> k[i] >> x[i];
            k[i]--;
            xs.eb(x[i]);
        } else if (t[i] == 3) {
            cin >> k[i];
            k[i]--;
        }
    }

    rearrange(xs);

    int K = sz(xs);
    Binary_Indexed_Tree<int> bit(K, 0);

    // rep(i, N) bit.add(lb(xs, a[i]), 1);

    set<ll> s;
    vector<ll> memo; // 捨てた値
    rep(i, N) s.emplace(i);

    rep(i, Q) {
        if (t[i] == 1) {
            a[k[i]] = x[i];
            if (!s.count(k[i])) {
                int p = bit.lower_bound(k[i] + 1);
                memo.eb(p);
                s.emplace(k[i]);
            }
        } else if (t[i] == 2) {
            each(e, s) {
                bit.add(lb(xs, a[e]), 1); //
            }
            each(e, memo) {
                bit.add(e, -1); //
            }
            s.clear();
            memo.clear();
        } else if (t[i] == 3) {
            if (s.count(k[i])) {
                cout << a[k[i]] << '\n';
            } else {
                int p = bit.lower_bound(k[i] + 1);
                cout << xs[p] << '\n';
            }
        }
    }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
0