結果
| 問題 | No.2809 Sort Query |
| ユーザー |
 ぷら
|
| 提出日時 | 2024-07-12 22:02:41 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,788 ms / 2,000 ms |
| コード長 | 5,592 bytes |
| コンパイル時間 | 1,846 ms |
| コンパイル使用メモリ | 152,876 KB |
| 最終ジャッジ日時 | 2025-02-22 04:05:28 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge6 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 71 |
ソースコード
#include <string.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cfloat>#include <climits>#include <cmath>#include <complex>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <list>#include <map>#include <memory>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using ll = long long;using pii = pair<int,int>;using pll = pair<ll,ll>;template <typename T> using vc = vector<T>;template <typename T> using vvc = vector<vector<T>>;template <typename T> using vvvc = vector<vector<vector<T>>>;template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }int dx4[] = {1,0,-1,0};int dy4[] = {0,1,0,-1};#define overload5(a, b, c, d, e, name, ...) name#define overload4(a, b, c, d, name, ...) name#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)#define REP1(i, n) for(ll i = 0; i < (n); ++i)#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)#define setbits(j, n) for(ll iiiii = (n), j = lowbit(iiiii); iiiii; iiiii ^= 1 << j, j = lowbit(iiiii))#define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(all(v)));)#define fi first#define se second#define pb push_back#define ppb pop_back#define ppf pop_front#define drop(s) cout << #s << endl, exit(0)#define si(c) (int)(c).size()#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))#define rng(v, l, r) v.begin() + (l), v.begin() + (r)#define all(c) c.begin(), c.end()#define rall(c) c.rbegin(), c.rend()#define SORT(v) sort(all(v))#define REV(v) reverse(all(v))#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define overload2(_1, _2, name, ...) name#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))template <typename T>struct SegmentTree {int n;vector<T> dat;SegmentTree() {}SegmentTree(int N) {n = 1;while(n < N) {n *= 2;}dat.resize(2*n-1);}void update(int x, T val) {x += n-1;dat[x] += val;while(x > 0) {x = (x-1)/2;dat[x] = dat[2*x+1]+dat[2*x+2];}}T query(int a, int b, int k, int l, int r) {if(r <= a || b <= l) return 0;if(a <= l && r <= b) return dat[k];T vl = query(a, b, 2*k+1, l, (l+r)/2);T vr = query(a, b, 2*k+2, (l+r)/2, r);return vl+vr;}T query(int a,int b) {//[a,b)return query(a,b,0,0,n);}};int main() {ios::sync_with_stdio(false);cin.tie(nullptr);int N,Q;cin >> N >> Q;vc<ll>A(N),B;rep(i,N) {cin >> A[i];B.pb(A[i]);}vc<array<ll,3>>query(Q);rep(i,Q) {cin >> query[i][0];if(query[i][0] == 1) {cin >> query[i][1] >> query[i][2];query[i][1]--;B.pb(query[i][2]);}if(query[i][0] == 3) {cin >> query[i][1];query[i][1]--;}}map<int,ll>id;rep(i,N) {id[i] = A[i];}B.pb(0);UNIQUE(B);SegmentTree<int>Seg(si(B));rep(i,N) {A[i] = 0;}Seg.update(0,N);auto calc = [&](int k) {int l = -1,r = si(B)-1;while(l+1 < r) {int mid = (l+r)/2;if(Seg.query(0,mid+1) < k) {l = mid;}else {r = mid;}}return B[r];};rep(i,Q) {if(query[i][0] == 1) {id[query[i][1]] = query[i][2];}if(query[i][0] == 2) {vc<int>res;for(auto i:id) {int pos1 = lower_bound(all(B),calc(i.fi+1))-B.begin();res.pb(pos1);}for(auto i:id) {int pos2 = lower_bound(all(B),i.se)-B.begin();Seg.update(pos2,1);}for(auto i:res) {Seg.update(i,-1);}id.clear();}if(query[i][0] == 3) {if(id.count(query[i][1])) {cout << id[query[i][1]] << "\n";continue;}cout << calc(query[i][1]+1) << "\n";}}}