結果

問題 No.649 ここでちょっとQK！
ユーザー hamamuhamamu
提出日時 2020-12-10 15:19:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 213 ms / 3,000 ms
コード長 12,678 bytes
コンパイル時間 4,008 ms
コンパイル使用メモリ 274,900 KB
実行使用メモリ 24,080 KB
最終ジャッジ日時 2024-09-19 20:33:39
合計ジャッジ時間 9,348 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 25 ms
8,608 KB
testcase_04 AC 136 ms
24,024 KB
testcase_05 AC 140 ms
24,080 KB
testcase_06 AC 49 ms
9,612 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 85 ms
12,864 KB
testcase_13 AC 85 ms
12,732 KB
testcase_14 AC 82 ms
12,712 KB
testcase_15 AC 87 ms
12,872 KB
testcase_16 AC 83 ms
12,864 KB
testcase_17 AC 93 ms
13,652 KB
testcase_18 AC 106 ms
14,692 KB
testcase_19 AC 116 ms
15,596 KB
testcase_20 AC 128 ms
16,400 KB
testcase_21 AC 138 ms
18,208 KB
testcase_22 AC 152 ms
18,872 KB
testcase_23 AC 165 ms
19,924 KB
testcase_24 AC 177 ms
20,588 KB
testcase_25 AC 187 ms
21,632 KB
testcase_26 AC 213 ms
22,544 KB
testcase_27 AC 3 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 65 ms
10,352 KB
testcase_31 AC 63 ms
10,436 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 1 ms
5,376 KB
testcase_35 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
using     ll=long long;     using   dd=double;     
using    vll=vector<   ll>; using  vdd=vector< dd>;
using   vvll=vector<  vll>; using vvdd=vector<vdd>;
using  vvvll=vector< vvll>; using vvvdd=vector<vvdd>;
using vvvvll=vector<vvvll>;
using   pll=pair<ll,ll>;  using   tll=tuple<ll,ll,ll>; using   qll=tuple<ll,ll,ll,ll>;
using  vpll=vector< pll>; using  vtll=vector< tll>;    using  vqll=vector< qll>;
using vvpll=vector<vpll>; using vvtll=vector<vtll>;    using vvqll=vector<vqll>;
constexpr ll INF = 1LL << 60;
struct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;
#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define rep(i, S, E)  for (ll i = (S); i <= (E); i++)
#define dep(i, E, S)  for (ll i = (E); i >= (S); i--)
#define each(e, v) for (auto&& e : v)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }
template<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }
template<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }
template<class T> inline ll sz(T &v){ return (ll)v.size(); }
inline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; }
inline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); }

//pair用テンプレート
using  vpll=vector< pll>;
using vvpll=vector<vpll>;
template<class T,class S> inline pair<T,S>& operator+=(pair<T,S> &a,const pair<T,S> &b){ a.first+=b.first; a.second+=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator-=(pair<T,S> &a,const pair<T,S> &b){ a.first-=b.first; a.second-=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator*=(pair<T,S> &a,const pair<T,S> &b){ a.first*=b.first; a.second*=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator/=(pair<T,S> &a,const pair<T,S> &b){ a.first/=b.first; a.second/=b.second; return a; }
template<class T,class S> inline pair<T,S>& operator%=(pair<T,S> &a,const pair<T,S> &b){ a.first%=b.first; a.second%=b.second; return a; }
template<class T,class S,class R> inline pair<T,S>& operator+=(pair<T,S> &a,R b){ a.first+=b; a.second+=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator-=(pair<T,S> &a,R b){ a.first-=b; a.second-=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator*=(pair<T,S> &a,R b){ a.first*=b; a.second*=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator/=(pair<T,S> &a,R b){ a.first/=b; a.second/=b; return a; }
template<class T,class S,class R> inline pair<T,S>& operator%=(pair<T,S> &a,R b){ a.first%=b; a.second%=b; return a; }
template<class T,class S,class R> inline pair<T,S> operator+(const pair<T,S> &a,R b){ pair<T,S> c=a; return c+=b; }
template<class T,class S,class R> inline pair<T,S> operator-(const pair<T,S> &a,R b){ pair<T,S> c=a; return c-=b; }
template<class T,class S,class R> inline pair<T,S> operator*(const pair<T,S> &a,R b){ pair<T,S> c=a; return c*=b; }
template<class T,class S,class R> inline pair<T,S> operator/(const pair<T,S> &a,R b){ pair<T,S> c=a; return c/=b; }
template<class T,class S,class R> inline pair<T,S> operator%(const pair<T,S> &a,R b){ pair<T,S> c=a; return c%=b; }
template<class T,class S,class R> inline pair<T,S> operator-(R b,const pair<T,S> &a){ pair<T,S> c=-a; return c+=b; }
template<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a){ pair<T,S> c=a; return c*=(-1); }
template<class T,class S> inline ostream &operator<<(ostream &os,const pair<T,S> &a){ return os << a.first << ' ' << a.second; }

//vector用テンプレート
template<class T> inline vector<T>& operator+=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]+=b[i];  return a; }
template<class T> inline vector<T>& operator-=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]-=b[i];  return a; }
template<class T> inline vector<T>& operator*=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]*=b[i];  return a; }
template<class T> inline vector<T>& operator/=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]/=b[i];  return a; }
template<class T> inline vector<T>& operator%=(vector<T> &a,const vector<T> &b){ for (ll i=0; i<(ll)a.size(); i++) a[i]%=b[i];  return a; }
template<class T,class S> inline vector<T>& operator+=(vector<T> &a,S b){ for (T &e: a) e+=b;  return a; }
template<class T,class S> inline vector<T>& operator-=(vector<T> &a,S b){ for (T &e: a) e-=b;  return a; }
template<class T,class S> inline vector<T>& operator*=(vector<T> &a,S b){ for (T &e: a) e*=b;  return a; }
template<class T,class S> inline vector<T>& operator/=(vector<T> &a,S b){ for (T &e: a) e/=b;  return a; }
template<class T,class S> inline vector<T>& operator%=(vector<T> &a,S b){ for (T &e: a) e%=b;  return a; }
template<class T,class S> inline vector<T> operator+(const vector<T> &a,S b){ vector<T> c=a; return c+=b; }
template<class T,class S> inline vector<T> operator-(const vector<T> &a,S b){ vector<T> c=a; return c-=b; }
template<class T,class S> inline vector<T> operator*(const vector<T> &a,S b){ vector<T> c=a; return c*=b; }
template<class T,class S> inline vector<T> operator/(const vector<T> &a,S b){ vector<T> c=a; return c/=b; }
template<class T,class S> inline vector<T> operator%(const vector<T> &a,S b){ vector<T> c=a; return c%=b; }
template<class T,class S> inline vector<T> operator-(S b,const vector<T> &a){ vector<T> c=-a; return c+=b; }
template<class T> inline vector<T> operator-(const vector<T> &a){ vector<T> c=a; return c*=(-1); }
template<class T> inline ostream &operator<<(ostream &os,const vector<T> &a){ for (ll i=0; i<(ll)a.size(); i++) os<<(i>0?" ":"")<<a[i];  return os; }

template<ll MOD> struct mll_{
	ll val;
	mll_(ll v = 0): val(v % MOD){ if (val < 0) val += MOD; }
	mll_ operator - () const { return -val; }
	mll_ operator + (const mll_ &b) const { return val + b.val; }
	mll_ operator - (const mll_ &b) const { return val - b.val; }
	mll_ operator * (const mll_ &b) const { return val * b.val; }
	mll_ operator / (const mll_ &b) const { return mll_(*this) /= b; }
	mll_ operator + (ll b) const { return *this + mll_(b); }
	mll_ operator - (ll b) const { return *this - mll_(b); }
	mll_ operator * (ll b) const { return *this * mll_(b); }
	friend mll_ operator + (ll a,const mll_ &b) { return b + a; }
	friend mll_ operator - (ll a,const mll_ &b) { return -b + a; }
	friend mll_ operator * (ll a,const mll_ &b) { return b * a; }
	friend mll_ operator / (ll a,const mll_ &b) { return mll_(a)/b; }
	mll_ &operator += (const mll_ &b) { val=(val+b.val)%MOD; return *this; }
	mll_ &operator -= (const mll_ &b) { val=(val+MOD-b.val)%MOD; return *this; }
	mll_ &operator *= (const mll_ &b) { val=(val*b.val)%MOD; return *this; }
	mll_ &operator /= (const mll_ &b) {
		ll c=b.val,d=MOD,u=1,v=0;
		while (d){
			ll t = c / d;
			c -= t * d; swap(c,d);
			u -= t * v; swap(u,v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll_ &operator += (ll b) { return *this += mll_(b); }
	mll_ &operator -= (ll b) { return *this -= mll_(b); }
	mll_ &operator *= (ll b) { return *this *= mll_(b); }
	mll_ &operator /= (ll b) { return *this /= mll_(b); }
	bool operator == (const mll_ &b) const { return val == b.val; }
	bool operator != (const mll_ &b) const { return val != b.val; }
	bool operator == (ll b) const { return *this == mll_(b); }
	bool operator != (ll b) const { return *this != mll_(b); }
	friend bool operator == (ll a,const mll_ &b) { return mll_(a) == b.val; }
	friend bool operator != (ll a,const mll_ &b) { return mll_(a) != b.val; }
	friend ostream &operator << (ostream &os,const mll_ &a) { return os << a.val; }
	friend istream &operator >> (istream &is,mll_ &a) { return is >> a.val; }
	static mll_ Combination(ll a,ll b){
		chmin(b,a-b);
		if (b<0) return mll_(0);
		mll_ c = 1;
		rep(i,0,b-1) c *= a-i;
		rep(i,0,b-1) c /= i+1;
		return c;
	}
};
//using mll = mll_<1000000007LL>;
using mll = mll_<998244353LL>;
using vmll    = std::vector<mll>;
using vvmll   = std::vector<vmll>;
using vvvmll  = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;


#if 1
#include <atcoder/all>
using namespace atcoder;
#endif
struct coordinateCompression{
	map<ll, ll> val2idx;
	vll idx2val;
	coordinateCompression(){}
	void add(ll val){
		val2idx[val]=0;
	}
	void add(vll v){
		each(e, v) val2idx[e]=0;
	}
	void compress(){
		ll cnt=0;
		each(e, val2idx){
			idx2val.push_back(e.first);
			e.second=cnt++;
		}
	}
	ll size(){
		return (ll)idx2val.size();
	}
	ll v2i(ll v){ return val2idx[v]; }
	ll i2v(ll i){ return idx2val[i]; }
};

template <class T> struct BIT_{
	vector<T> v; ll N;
	BIT_(){}
	BIT_(ll N) { Init(N); }
	void Init(ll N) { v.resize(N+1); this->N = N; }
	void add(ll i, T x) { for (i++; i<=N; i+=i&(-i)) v[i]+=x; }
	T sum(ll i) { T s=0;  for (i++; i>0; i-=i&(-i)) s+=v[i];  return s; }
	T sum(ll i, ll j) { return sum(j)-sum(i-1); }
	T sum() { return sum(N-1); } //総和
	T operator[](ll i) { return sum(i,i); }
	ll lower_bound(T s){
		ll i=0,l=1;  while (l<N) l<<=1;
		for(; l>0; l>>=1) if(i+l<=N && v[i+l]<s) s-=v[i+=l];
		return i;
	}
	void Dump() { rep(i,0,N-1) cerr<<setw(3)<< i <<" "<<setw(5)<< sum(i,i) <<'\n'; }
	/*---- 集合管理用I/F ----*/
	ll size() { return sum(); } //要素数
	void insert(ll x) { add(x,1); }//集合にx追加
	void erase(ll x) { add(x,-1); }//集合からx1つ削除
	bool contains(ll x) { return (*this)[x] >= 1; } //x∈集合ならtrue
	ll rank(ll x) { return sum(x-1)+1; }//xが小さい方から何番目か 1-origin
	ll rrank(ll x) { return sum(x+1,N-1)+1; }//xが大きい方から何番目か 1-origin
	ll leftnumof(ll x) { return sum(x); }//x以下の個数
	ll rightnumof(ll x) { return sum(x,N-1); }//x以上の個数
	ll nthsmall(ll r) { return lower_bound(r); } //r番目に小さい要素 1-origin
	ll nthbig(ll r) { return (size()<r) ? -1 : nthsmall(size()+1-r); }
	                                             //r番目に大きい要素 1-origin
};
using BIT = BIT_<ll>;


void solve()
{
	//BIT bitt(10);
	//bitt.insert(0);
	//bitt.insert(9);
	//bitt.insert(9);
	//bitt.insert(5);
	//bitt.insert(3);
	//bitt.insert(3);
	//bitt.insert(3);
	//bitt.insert(1);
	//cout << bitt.nthsmall(5) << '\n';
	//cout << bitt.nthsmall(6) << '\n';
	//cout << bitt.nthsmall(7) << '\n';
	//cout << bitt.nthsmall(8) << '\n';
	//cout << bitt.nthsmall(9) << '\n';
	//cout << bitt.nthsmall(10) << '\n';
	//cout << bitt.nthbig(3) << '\n';
	//cout << bitt.nthbig(4) << '\n';
	//cout << bitt.nthbig(5) << '\n';
	//cout << bitt.nthbig(6) << '\n';
	//cout << bitt.nthbig(7) << '\n';
	//cout << bitt.nthbig(8) << '\n';
	//cout << bitt.nthbig(9) << '\n';
	//cout << bitt.nthbig(10) << '\n';
	//cout <<boolalpha <<bitt.contains(3) << '\n';
	//cout <<boolalpha << bitt.contains(4) << '\n';
	//cout <<boolalpha << bitt.contains(8) << '\n';

	ll q,k;  cin >> q >> k;

	vector<pair<ll,ll>> kv(q);
	vll buf;
	rep(i,0,q-1){
		ll k; ll v=-1;
		cin>>k;
		if (k==1) cin >> v;
		kv[i]={k,v};
		if (k==1)buf.push_back(v);
	}

	coordinateCompression co;
	co.add(buf);
	co.compress();
	ll n=co.size();
	BIT bit(n);

	vll ans;
	rep(i,0,sz(kv)-1){
		ll kind,v;  tie(kind,v) = kv[i];

		if (kind==1){
			ll idx=co.v2i(v);
			bit.insert(idx);
		}
		else{//kind==2
			ll idx=bit.nthsmall(k);
			if (idx==bit.N){
				ans.push_back(-1);
			}
			else{
				ll val=co.i2v(idx);
				ans.push_back(val);
				bit.erase(idx);
			}
		}
	}
	each(e,ans) cout << e << '\n';
	return;
}


int main(){
#if 1
	solve();
	//cin2solve();
	//generand();
#else
	ll t;  cin >> t;
	rep(i, 0, t-1){
		solve();
		//cin2solve();
	}
#endif
	return 0;
}
0