結果

問題 No.2809 Sort Query
コンテスト
ユーザー fuppy_kyopro
提出日時 2024-07-13 01:31:30
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,098 ms / 2,000 ms
コード長 7,052 bytes
コンパイル時間 12,369 ms
コンパイル使用メモリ 296,228 KB
最終ジャッジ日時 2025-02-22 06:09:15
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 71
権限があれば一括ダウンロードができます

ソースコード

diff # 

//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
T ceil_div(T a, T b) {
    return (a + b - 1) / b;
}
template <class T>
T safe_mul(T a, T b) {
    if (a == 0 || b == 0) return 0;
    if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();
    return a * b;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
vector<int> gen_perm(int n) {
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
        cerr << fixed << setprecision(25);
    }
} setup_io;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
// #define mp make_pair

class Bit {
  public:
    int n;
    vl bit; // 0-index

    Bit(int _n) {
        n = _n;
        bit.resize(n);
    }

    // [0, i)
    ll sum(int i) {
        ll s = 0;
        while (i > 0) {
            s += bit[i - 1];
            i -= i & -i;
        }
        return s;
    }

    // [l, r)
    ll sum(int l, int r) {
        return sum(r) - sum(l);
    }

    void add(int i, ll x) {
        i++;
        while (i <= n) {
            bit[i - 1] += x;
            i += i & -i;
        }
    }

    ll min_xth(int x) {
        int left = -1, right = n;
        while (left + 1 < right) {
            int mid = (left + right) / 2;
            int temp = sum(mid + 1);
            if (temp < x) {
                left = mid;
            } else {
                right = mid;
            }
        }
        return right;
    }

    ll bubble(vi p) {
        int n = p.size();
        ll ans = 0;
        for (int j = 0; j < n; j++) {
            ans += (j - sum(p[j] + 1));
            add(p[j], 1);
        }
        return ans;
    }
};

template <typename T>
class Zaatsu {
    bool is_build;
    vector<T> elements;

  public:
    Zaatsu() : is_build(false) {}

    void add(T x) {
        elements.push_back(x);
    }

    void add(vector<T> x) {
        for (int i = 0; i < (int)x.size(); i++) {
            elements.push_back(x[i]);
        }
    }

    int build() {
        sort(elements.begin(), elements.end());
        UNIQUE(elements);
        is_build = true;
        return elements.size();
    }

    int operator[](T x) {
        assert(is_build);
        return lower_bound(elements.begin(), elements.end(), x) - elements.begin();
    }

    T original(int i) {
        assert(is_build);
        return elements[i];
    }
};

signed main() {
    int n, q;
    cin >> n >> q;

    vl a(n, -1);
    rep(i, n) {
        cin >> a[i];
    }
    Zaatsu<ll> za;
    za.add(a);

    vl t(q), k(q), x(q);
    rep(i, q) {
        cin >> t[i];
        if (t[i] == 1) {
            cin >> k[i] >> x[i];
            k[i]--;
            za.add(x[i]);
        } else if (t[i] == 2) {
        } else {
            cin >> k[i];
            k[i]--;
        }
    }

    int cnt = za.build();
    Bit bit(cnt);
    set<int> changed;
    vl before(n);
    rep(i, n) {
        before[i] = a[i];
        bit.add(za[a[i]], 1);
        changed.insert(i);
    }

    auto get_kth = [&](int k) {
        int now = bit.min_xth(k + 1);
        // DEBUG(pii(k, now));
        return za.original(now);
    };

    rep(i, q) {
        if (t[i] == 1) {
            a[k[i]] = x[i];
            if (changed.count(k[i]) == 0) {
                before[k[i]] = get_kth(k[i]);
            }
            changed.insert(k[i]);
        } else if (t[i] == 2) {
            while (changed.size()) {
                int idx = *changed.begin();
                changed.erase(changed.begin());

                // DEBUG(idx);
                // DEBUG(before[idx]);
                // DEBUG(a[idx]);

                bit.add(za[before[idx]], -1);
                bit.add(za[a[idx]], 1);

                a[idx] = -1;
            }
        } else {
            if (changed.count(k[i]) == 0) {
                cout << get_kth(k[i]) << endl;
            } else {
                cout << a[k[i]] << endl;
            }
        }
    }
}
0