結果
| 問題 | No.2809 Sort Query |
| ユーザー |
 Slephy
|
| 提出日時 | 2024-07-12 23:14:43 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,323 ms / 2,000 ms |
| コード長 | 9,983 bytes |
| コンパイル時間 | 3,776 ms |
| コンパイル使用メモリ | 218,288 KB |
| 最終ジャッジ日時 | 2025-02-22 05:25:31 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge6 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 71 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;const int INF = (int)1e9 + 1001010;const ll llINF = (long long)4e18 + 22000020;const string endn = "\n";template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}const string ELM_SEP = " ", VEC_SEP = endn;template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELM_SEP : "");}return o;}template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEP : "");} return o;}template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}ll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}ll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}#ifdef DEBUG#include <cpp-dump/dump.hpp>#define dump(...) cpp_dump(__VA_ARGS__)namespace cp = cpp_dump;struct InitCppDump{InitCppDump(){if(!isatty(fileno(stderr))) CPP_DUMP_SET_OPTION(es_style, cpp_dump::es_style_t::no_es);CPP_DUMP_SET_OPTION(log_label_func, cp::log_label::line());CPP_DUMP_SET_OPTION(max_iteration_count, 30);}} init_cpp_dump;#else#define dump(...)#endif// ================================== ここまでテンプレ ==================================template<typename T>class Compressor{vector<T> vals;public:// コンストラクタ// O(NlogN)Compressor(const vector<vector<T>> &data){vals.reserve(data.size() * data[0].size());for(int i = 0; i < data.size(); i++){std::copy(data[i].begin(), data[i].end(), back_inserter(vals));}sort(vals.begin(), vals.end());vals.erase(unique(vals.begin(), vals.end()), vals.end());}Compressor(const vector<T> &data) : vals(data){sort(vals.begin(), vals.end());vals.erase(unique(vals.begin(), vals.end()), vals.end());}// 圧縮前の値 value に対応する圧縮後の値 index を返す// O(logN)int get_index(T value){auto lb = lower_bound(vals.begin(), vals.end(), value);assert(lb != vals.end() && *lb == value);return (int)(lb - vals.begin());}// 圧縮後の値 index に対応する圧縮前の値 value を返す// O(1)T get_value(size_t index){return vals.at(index);}// 圧縮後の配列のサイズを返す// O(1)int size() const {return vals.size();}};// ACLの実装を一部改変したもの// == 変更点 ==// internal::ceil_pow2 を埋め込み// add関数 を追加// size関数 を追加template <class S, S (*op)(S, S), S (*e)()> struct segtree {public:segtree() : segtree(0) {}explicit segtree(int n) : segtree(vector<S>(n, e())) {}explicit segtree(const vector<S>& v) : _n(int(v.size())) {log = 0;while((1U << log) < (unsigned int)(_n)) log++;_size = 1 << log;d = 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);}}size_t size() const {return _n;}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);}void add(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) const {assert(0 <= p && p < _n);return d[p + _size];}S prod(int l, int r) const {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() const { return d[1]; }template <bool (*f)(S)> int max_right(int l) const {return max_right(l, [](S x) { return f(x); });}template <class F> int max_right(int l, F f) const {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) const {return min_left(r, [](S x) { return f(x); });}template <class F> int min_left(int r, F f) const {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;}friend ostream& operator<<(ostream &os, const segtree &st) {os << "[";for (int i = 0; i < st._n; i++) {if (i != 0) os << ", ";os << st.get(i);}os << "]";return os;}private:int _n, _size, log;vector<S> d;void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }};template<class S> struct RangeSum {static S op(S l, S r){ return l + r; }static S e(){ return 0; }using Type = struct segtree<S, op, e>;};template<class S> struct RangeMin {static S op(S l, S r){ return min(l, r); }static S e(){ return numeric_limits<S>::max(); }using Type = struct segtree<S, op, e>;};template<class S> struct RangeMax {static S op(S l, S r){ return max(l, r); }static S e(){ return numeric_limits<S>::min(); }using Type = struct segtree<S, op, e>;};// ex) RangeMin<int>::Type seg(10);template<class Judgement>ll binary_search_ll(ll ok, ll ng, Judgement judge){auto need_continue = [&]() -> bool {if(ok > ng) return((__int128_t)ok - (__int128_t)ng > 1);else return ((__int128_t)ng - (__int128_t)ok > 1);};while(need_continue()){ll mid = ((__int128_t)ok + (__int128_t)ng) / 2;if(judge(mid)) ok = mid;else ng = mid;}return ok;};int main(int argc, char *argv[]){ios::sync_with_stdio(false);cin.tie(nullptr);ll n, q; cin >> n >> q;vector<ll> a(n); cin >> a;vector<ll> all_a = a;vector<tuple<ll, ll, ll>> ops(q);for(int qid = 0; qid < q; qid++){auto &[v0, v1, v2] = ops[qid];cin >> v0;if(v0 == 1){cin >> v1 >> v2;v1--;all_a.emplace_back(v2);}if(v0 == 2){}if(v0 == 3){cin >> v1;v1--;}}Compressor<ll> comp(all_a);RangeSum<ll>::Type seg(comp.size());for(int i = 0; i < a.size(); i++){seg.add(comp.get_index(a[i]), 1);}map<ll, ll> changed; // {a_idx, comp_idx}vector<ll> will_delete; // comp_idxbool sorted = false;for(int qid = 0; qid < q; qid++){const auto &[op, k, x] = ops[qid];dump(op, k, x);auto judge = [&](ll mid) -> bool {// [0, mid] >= sum ?ll sum = seg.prod(0, mid+1);return (sum >= k+1);};auto get_comp_idx = [&](ll k) -> ll {// return comp_idx of a[k]if(sorted) return binary_search_ll((int)comp.size()-1, -1, judge);else if(changed.count(k)) return changed[k];else return comp.get_index(a[k]);};if(op == 1){// changeif(!changed.count(k)){ll comp_idx = get_comp_idx(k);dump(comp_idx);will_delete.emplace_back(comp_idx);}changed[k] = comp.get_index(x);}if(op == 2){// sortfor(auto [a_idx, comp_idx] : changed){seg.add(comp_idx, 1);}for(auto idx : will_delete){seg.add(idx, -1);}changed.clear();will_delete.clear();sorted = true;}if(op == 3){// outputif(changed.count(k)){cout << comp.get_value(changed[k]) << endl;}else{dump(seg);// ll comp_idx = binary_search_ll((int)comp.size()-1, -1, judge);ll comp_idx = get_comp_idx(k);dump(comp_idx);cout << comp.get_value(comp_idx) << endl;}}}return 0;}