結果

問題 No.3167 [Cherry 7th Tune C] Cut in Queue
ユーザー akiaa11
提出日時 2025-06-02 23:45:29
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 566 ms / 2,500 ms
コード長 4,412 bytes
コンパイル時間 4,259 ms
コンパイル使用メモリ 261,824 KB
実行使用メモリ 22,024 KB
最終ジャッジ日時 2025-06-02 23:45:48
合計ジャッジ時間 17,985 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<int(n);++i)
#define rep2(i,a,n) for(int i=int(a);i<int(n);++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
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;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int op(int a, int b){return a + b;}
int e(){return 0;}
int bs;
int f(int k){return k < bs;}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n;cin>>n;
	veci a(n);
	rep(i, n) cin>>a[i], a[i]--;
	int q;cin>>q;
	veci ty(q), qr(q);
	rep(i, q){
		cin>>ty[i];
		if(ty[i] == 1) cin>>qr[i], qr[i]--;
		else if(ty[i] == 3) cin>>qr[i], qr[i]--;
	}
	veci idx(n + q), d(n + q);
	{
		veci pr(n + q, -1);
		rep(i, 1, n) pr[a[i]] = a[i - 1];
		int v = n, lst = a[n - 1];
		rep(i, q) if(ty[i] == 1){
			if(qr[i] == -1) pr[v] = lst, lst = v++;
			else pr[v] = pr[qr[i]], pr[qr[i]] = v++;
		}
		v = 0;
		rep(i, n + 1){
			int cur;
			if(i == n){
				if(lst == a[n - 1]) break;
				cur = lst;
			}else cur = a[i];
			veci t{cur};
			while(pr[cur] != -1 && pr[cur] >= n){
				t.push_back(pr[cur]);
				cur = pr[cur];
			}
			rrep(i, t.size()) idx[t[i]] = v, d[v++] = t[i];
		}
		idx.erase(idx.begin() + v, idx.end());
		d.erase(d.begin() + v, d.end());
	}
	segtree<int, op, e> sg(d.size());
	rep(i, n) sg.set(idx[a[i]], 1);
	int k = n, v = 0;
	rep(i, q){
		if(ty[i] == 1){
			sg.set(idx[k++], 1);
		}else if(ty[i] == 2){
			bs = 1;
			int r = sg.max_right(0, f);
			assert(sg.get(r) > 0);
			sg.set(r, 0);
		}else{
			bs = qr[i] + 1;
			cout<<d[sg.max_right(0, f)] + 1<<endl;
		}
	}
}
0