結果

問題 No.3167 [Cherry 7th Tune C] Cut in Queue
ユーザー hint908
提出日時 2025-05-30 22:19:17
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 635 ms / 2,500 ms
コード長 3,850 bytes
コンパイル時間 3,600 ms
コンパイル使用メモリ 287,876 KB
実行使用メモリ 50,080 KB
最終ジャッジ日時 2025-05-30 22:19:37
合計ジャッジ時間 17,109 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}

#include<atcoder/segtree>
using namespace atcoder;

ll op(ll l, ll r){return l+r;}
ll e(){return 0;}

void solve(){
    ll n;
    cin >> n;
    V<ll> v(n);
    rep(i, n) cin >> v[i];
    ll q;
    cin >> q;
    V<ll> next(n+q+3, -1), prev(n+q+3, -1);
    next[0] = v[0];
    rep(i, n){
        if(i == 0){
            next[0] = v[0];
            prev[v[0]] = 0;
        }
        if(i != n-1){
            next[v[i]] = v[i+1];
            prev[v[i+1]] = v[i];
        }
        if(i == n-1){
            next[v[n-1]] = n+q+1;
            prev[n+q+1] = v[n-1];
        }
    }
    V<pair<ll,ll>> query;
    ll nx = n+1;
    rep(i, q){
        ll t;
        cin >> t;
        if(t == 1){
            ll x;
            cin >> x;
            query.eb(t, x);
            if(x == 0) x = n+q+1;
            ll val = prev[x];
            next[val] = nx;
            next[nx] = x;
            prev[x] = nx;
            prev[nx] = val;
            // cout << val << " " << nx << " " << x << endl;
            nx++;
        }else if(t == 2){
            query.eb(t, -1);
            
        }else{
            assert(t == 3);
            ll x;
            cin >> x;
            query.eb(t, x);
        }
    }
    
    V<ll> w;
    ll id = 0;
    while(id != n+q+1){
        w.eb(id);
        id = next[id];
        // cout << id << endl;
    }
    
    V<ll> pos(n+q+10, -1);
    V<ll> vv;
    rep(i, w.size()){
        ll x = w[i];
        if(x == 0 or x > n) vv.eb(0);
        else vv.eb(1);
        pos[w[i]] = i;
    }
    segtree<ll, op, e> seg(vv);
    nx = n+1;
    for(auto [t,x]:query){
        if(t == 1){
            seg.set(pos[nx++], 1);
        }else if(t == 2){
            ll idx = seg.max_right(0, [&](int k){
                return k < 1;
            });
            seg.set(idx, 0);
        }else{
            ll idx = seg.max_right(0, [&](int k){
                return k < x;
            });
            cout << w[idx] << endl;
        }
    }
    
    
    
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}
0