結果

問題 No.2809 Sort Query
ユーザー leaf_1415leaf_1415
提出日時 2024-07-12 22:19:05
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 827 ms / 2,000 ms
コード長 12,940 bytes
コンパイル時間 2,178 ms
コンパイル使用メモリ 124,308 KB
実行使用メモリ 53,124 KB
最終ジャッジ日時 2024-07-12 22:20:27
合計ジャッジ時間 41,786 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 12 ms
27,744 KB
testcase_01 AC 338 ms
37,640 KB
testcase_02 AC 337 ms
36,872 KB
testcase_03 AC 336 ms
37,316 KB
testcase_04 AC 341 ms
36,872 KB
testcase_05 AC 335 ms
36,868 KB
testcase_06 AC 235 ms
35,164 KB
testcase_07 AC 243 ms
35,928 KB
testcase_08 AC 236 ms
34,956 KB
testcase_09 AC 235 ms
33,624 KB
testcase_10 AC 235 ms
37,208 KB
testcase_11 AC 535 ms
48,780 KB
testcase_12 AC 554 ms
48,088 KB
testcase_13 AC 558 ms
49,964 KB
testcase_14 AC 533 ms
50,144 KB
testcase_15 AC 521 ms
49,580 KB
testcase_16 AC 547 ms
50,188 KB
testcase_17 AC 538 ms
49,956 KB
testcase_18 AC 534 ms
50,648 KB
testcase_19 AC 586 ms
48,196 KB
testcase_20 AC 531 ms
47,964 KB
testcase_21 AC 776 ms
52,020 KB
testcase_22 AC 827 ms
52,104 KB
testcase_23 AC 774 ms
53,124 KB
testcase_24 AC 769 ms
52,116 KB
testcase_25 AC 795 ms
51,944 KB
testcase_26 AC 608 ms
45,452 KB
testcase_27 AC 632 ms
45,452 KB
testcase_28 AC 600 ms
45,324 KB
testcase_29 AC 615 ms
45,584 KB
testcase_30 AC 625 ms
45,448 KB
testcase_31 AC 370 ms
43,472 KB
testcase_32 AC 380 ms
43,300 KB
testcase_33 AC 405 ms
41,380 KB
testcase_34 AC 411 ms
41,388 KB
testcase_35 AC 375 ms
41,416 KB
testcase_36 AC 493 ms
49,372 KB
testcase_37 AC 495 ms
49,668 KB
testcase_38 AC 525 ms
49,960 KB
testcase_39 AC 506 ms
48,824 KB
testcase_40 AC 514 ms
50,352 KB
testcase_41 AC 303 ms
35,840 KB
testcase_42 AC 320 ms
34,220 KB
testcase_43 AC 306 ms
35,744 KB
testcase_44 AC 302 ms
33,840 KB
testcase_45 AC 308 ms
36,680 KB
testcase_46 AC 251 ms
32,820 KB
testcase_47 AC 277 ms
34,840 KB
testcase_48 AC 261 ms
33,976 KB
testcase_49 AC 246 ms
34,544 KB
testcase_50 AC 246 ms
35,276 KB
testcase_51 AC 398 ms
33,560 KB
testcase_52 AC 218 ms
34,244 KB
testcase_53 AC 219 ms
34,424 KB
testcase_54 AC 240 ms
32,972 KB
testcase_55 AC 303 ms
33,704 KB
testcase_56 AC 282 ms
34,752 KB
testcase_57 AC 233 ms
32,216 KB
testcase_58 AC 214 ms
34,276 KB
testcase_59 AC 252 ms
32,920 KB
testcase_60 AC 217 ms
36,984 KB
testcase_61 AC 285 ms
36,428 KB
testcase_62 AC 229 ms
32,604 KB
testcase_63 AC 287 ms
35,784 KB
testcase_64 AC 335 ms
36,864 KB
testcase_65 AC 182 ms
32,952 KB
testcase_66 AC 12 ms
27,884 KB
testcase_67 AC 13 ms
27,756 KB
testcase_68 AC 12 ms
27,756 KB
testcase_69 AC 12 ms
27,756 KB
testcase_70 AC 13 ms
27,628 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define pers(x, s) for(ll x = (ll)(s).size()-1; (x) >= 0; (x)--)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> using Preq = priority_queue<T>;
template<class T> using preq = priority_queue<T, vector<T>, greater<T>>;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

const int mod = 998244353;
//const int mod = 1000000007;

struct mint{
	int x;
	mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
	mint(const mint &ope) {x = ope.x;}
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

ll modpow(ll a, ll n, ll mod){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
	else return modpow((a*a)%mod, n/2, mod) % mod;
}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
mint divide(int n, int k){ if(n == 0 && k == 0) return 1; return comb(n+k-1, k-1); }
template<typename T> T comb2(ll n, ll k){ if(n < 0 || k < 0 || n < k) return T(0); T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}
mint cat(ll w, ll h, ll b = 0){ return comb(w+h, w) - comb(w+h, h+b+1); } //b >= 0;

vector<ll> prime, pvec, qrime;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
		for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
	}
}
void make_qrime(int n){
	qrime.resize(n+1);
	rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}
void factorize(ll n, map<ll, ll> &mp){
	mp.clear();
	for(auto p : pvec) while(n % p == 0) mp[p]++, n /= p;
	if(n > 1) mp[n]++;
}

template<typename S, typename T, typename U> bool isin(S x, T l, U r){return l <= x && x <= r;}
template<typename T> bool isdigit(T c){return isin(c, '0', '9');}
template<typename T> bool islower(T c){return isin(c, 'a', 'z');}
template<typename T> bool isupper(T c){return isin(c, 'A', 'Z');}

bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
template<typename T> T arith(T x){return x*(x+1)/2;}
template<typename T> T arith2(T x){return x*(x+1)*(x*2+1)/6;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
	x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
	return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}
template<typename T> vector<pair<T, ll>> rle(vector<T> vec){
	vector<pair<T, ll>> ret;
	for(auto x : vec){if(sz(ret) == 0 || ret.back().first != x) ret.push_back(P(x, 1)); else ret.back().second++;}
	return ret;
}
vector<pair<char, ll>> rle(string s){ vector<char> vec; for(auto c : s) vec.push_back(c); return rle(vec);}

template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
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 T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}
template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);}
template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));}
template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i,  deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T> void outg(T a[], ll sy, ll ty, ll sx, ll tx){rep(y, sy, ty){rep(x, sx, tx){cout << a[x][y]; if(x < tx) cout << " ";} cout << endl;}}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}
template<typename T> void bssert(bool b, T t){ if(!b) cout << t << endl, exit(0); }

struct SegTree{
	typedef ll SEG;

	int size;
	vector<SEG> seg;

	SegTree(){}
	SegTree(int size){
		this->size = size;
		seg.resize(1<<(size+1));
	}

	SEG id(){  //identity element
		return 0;
	}
	SEG ope(SEG a, SEG b){ //operator
		return a+b;
	}
	bool comp(SEG a, SEG b){
		return a >= b;
	}

	void init(){
		for(int i = 0; i < (1<<(size+1)); i++) seg[i] = id();
	}
	void set(int i, SEG x){
		seg[i+(1<<size)] = x;
	}
	void setup(){
		for(int i = (1<<size)-1; i >= 1; i--) seg[i] = ope(seg[i*2], seg[i*2+1]);
	}
	void update(int i, SEG val){
		i += (1 << size);
		seg[i] = val;
		while(i > 1){
			i /= 2;
			seg[i] = ope(seg[i*2], seg[i*2+1]);
		}
	}
	SEG query(int a, int b, int k, int l, int r){
		if(b < l || r < a) return id();
		if(a <= l && r <= b) return seg[k];
		SEG lval = query(a, b, k*2, l, (l+r)/2);
		SEG rval = query(a, b, k*2+1, (l+r)/2+1, r);
		return ope(lval, rval);
	}
	SEG query(ll a, ll b){
		if(a > b) return id();
		return query(a, b, 1, 0, (1<<size)-1);
	}
	int left_find(int r, SEG x){ //return largest l s.t. comp(query(l, r), x) = true
		int k = r + (1<<size);
		if(comp(seg[k], x)) return r;

		SEG sum = seg[k];
		while(1){
			if((k&(k-1)) == 0) return -1;
			if(comp(ope(seg[k-1], sum), x)) break;
			if(k % 2) sum = ope(seg[k-1], sum);
			k /= 2;
		}
		k--;
		while(k < (1<<size)){
			if(comp(ope(seg[k*2+1], sum), x)) k = k*2+1;
			else sum = ope(seg[k*2+1], sum), k = k*2;
		}
		return k - (1<<size);
	}
	int right_find(int l, SEG x){ //return smallest r s.t. comp(query(l, r), x) = true
		int k = l + (1<<size);
		if(comp(seg[k], x)) return l;

		SEG sum = seg[k];
		while(1){
			if((k&(k+1)) == 0) return 1<<(size+1);
			if(comp(ope(sum, seg[k+1]), x)) break;
			if(k % 2 == 0) sum = ope(sum, seg[k+1]);
			k /= 2;
		}
		k++;
		while(k < (1<<size)){
			if(comp(ope(sum, seg[k*2]), x)) k = k*2;
			else sum = ope(sum, seg[k*2]), k = k*2+1;
		}
		return k - (1<<size);
	}
};

ll n, Q;
ll a[300005], cnt[600005];
ll t[300005], k[300005], x[300005];
SegTree seg(20);

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> Q;
	rep(i, 1, n) cin >> a[i];
	rep(i, 1, Q){
		cin >> t[i];
		if(t[i] == 1) cin >> k[i] >> x[i];
		if(t[i] == 3) cin >> k[i];
	}
	bool flag = false;

	vector<ll> comp;
	rep(i, 1, n) comp.pb(a[i]);
	rep(i, 1, Q) if(t[i] == 1) comp.pb(x[i]);
	uniq(comp);
	ll m = sz(comp);

	rep(i, 1, n) a[i] = lower_bound(all(comp), a[i]) - comp.begin();
	rep(i, 1, Q) if(t[i] == 1) x[i] = lower_bound(all(comp), x[i]) - comp.begin();

	map<ll, ll> mp; vector<ll> vec;
	rep(i, 1, Q){
		if(!flag){
			if(t[i] == 1) a[k[i]] = x[i];
			if(t[i] == 2){
				flag = true;
				seg.init();
				rep(i, 1, n) cnt[a[i]]++;
				rep(i, 0, m-1) seg.set(i, cnt[i]);
				seg.setup();
			}
			if(t[i] == 3){
				ll ans = a[k[i]];
				cout << comp[ans] << "\n";
			}
		}
		else{
			if(t[i] == 1){
				if(mp.count(k[i]) == 0) vec.pb(seg.right_find(0, k[i]));
				mp[k[i]] = x[i];
			}
			if(t[i] == 2){
				for(auto x : vec) seg.update(x, seg.query(x, x)-1);
				for(auto p : mp) seg.update(p.se, seg.query(p.se, p.se)+1);
				mp.clear(), vec.clear();
			}
			if(t[i] == 3){
				ll ans;
				if(mp.count(k[i])) ans = mp[k[i]];
				else ans = seg.right_find(0, k[i]);
				cout << comp[ans] << "\n";
			}
		}
	}

	return 0;
}
0