verify/yosupo/data-structure/persistent-queue/persistent_queue.test.cpp

• View this file on GitHub
• Last update: 2026-10-24 00:10:28+07:00
• Problem: https://judge.yosupo.jp/problem/persistent_queue

Depends on

• data-structure/persistent-queue.hpp
• template.hpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/persistent_queue"
#include "template.hpp"
#include "data-structure/persistent-queue.hpp"

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    PersistentQueue<int> q;
    for(int i=0;i<n;i++){
        int op,t;
        cin >> op >> t;
        if(op==0){
            int x;
            cin >> x;
            q.push(t,x);
        }else{
            cout << q.front(t) << "\n";
            q.pop(t);
        }
    }
}

#line 1 "verify/yosupo/data-structure/persistent-queue/persistent_queue.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/persistent_queue"
#line 2 "template.hpp"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using db = long double;
using i128 = __int128_t;
using u32 = uint32_t;
using u64 = uint64_t;
template<class T>
using PQ = priority_queue<T,vector<T>,greater<T>>;

const int INF=INT_MAX/2;
const ll LINF=LLONG_MAX/4;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));

#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SZ(a) (int)(a.size())
#define SORT(a) sort(ALL(a))
#define RSORT(a) sort(RALL(a))
#define REV(a) reverse(ALL(a))
#define UNI(a) a.erase(unique(ALL(a)),a.end())
#define LB(a,x) (int)(lower_bound(ALL(a),x)-a.begin())
#define UB(a,x) (int)(upper_bound(ALL(a),x)-a.begin())
#define FIND(a,x) (int)(find(ALL(a),x)-a.begin())
#define COUNT(a,x) (int)count(ALL(a),x)
#define MIN(a) *min_element(ALL(a))
#define MAX(a) *max_element(ALL(a))

template<class T,class U>
bool chmin(T &a,U b){return b<a?a=b,1:0;}
template<class T,class U>
bool chmax(T &a,U b){return a<b?a=b,1:0;}

template<class T>
T floor(T a,T b){return a/b-((a^b)<0&&a%b);}
template<class T>
T ceil(T a,T b){return a/b+((a^b)>=0&&a%b);}

int popcnt(ll x){return __builtin_popcountll(x);}
int topbit(ll x){return x==0?-1:63-__builtin_clzll(x);}
int lowbit(ll x){return x==0?-1:__builtin_ctzll(x);}

template<class T,class U>
T SUM(const U &a){return accumulate(ALL(a),T{});}
template<class T>
vector<int> argsort(const vector<T> &a){
    vector<int> p(SZ(a));
    iota(ALL(p),0);
    stable_sort(ALL(p),[&](int i,int j){return a[i]<a[j];});
    return p;
}

template<class T,size_t D=0>
struct VecBuilder{
    array<size_t,D> d;
    VecBuilder<T,D+1> operator[](size_t n)const{
        VecBuilder<T,D+1> res{};
        for(size_t i=0;i<D;i++)res.d[i]=d[i];
        res.d[D]=n;
        return res;
    }
    template<size_t I=0>
    auto build(const T &x)const{
        if constexpr(I+1==D)return vector<T>(d[I],x);
        else return vector<decltype(build<I+1>(x))>(d[I],build<I+1>(x));
    }
    auto operator()(const T &x=T())const{
        static_assert(D>0);
        return build(x);
    }
};
template<class T>
inline constexpr VecBuilder<T> VEC{};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
#line 2 "data-structure/persistent-queue.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-06-28
 * Description: Persistent Queue.
 */

template<class T>
struct PersistentQueue{
    int n,lg;
    vector<T> dat;
    vector<int> back_id,len;
    vector<vector<int>> par;
    PersistentQueue():n(1),lg(1),dat(0),back_id(0),len(0),par(1,{0}){}
    void calc_par(){
        if(n<(1<<lg))return;
        for(int i=0;i<n;i++)par[i].emplace_back(par[par[i][lg-1]][lg-1]);
        lg++;
    }
    int push(int t,const T &val){
        dat.emplace_back(val);
        back_id.emplace_back(n);
        len.emplace_back((t==-1?0:len[t])+1);
        par.emplace_back(vector<int>(lg,0));
        par[n][0]=t==-1?0:back_id[t];
        for(int i=1;i<lg;i++)par[n][i]=par[par[n][i-1]][i-1];
        n++;
        calc_par();
        return back_id.size()-1;
    }
    int pop(int t){
        back_id.emplace_back(back_id[t]);
        len.emplace_back(len[t]-1);
        return back_id.size()-1;
    }
    T front(int t){
        int d=size(t)-1;
        int x=back_id[t];
        for(int j=lg-1;j>=0;j--)if(d>>j&1)x=par[x][j];
        return dat[x-1];
    }
    int size(int t){
        return len[t];
    }
};

#line 4 "verify/yosupo/data-structure/persistent-queue/persistent_queue.test.cpp"

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    PersistentQueue<int> q;
    for(int i=0;i<n;i++){
        int op,t;
        cin >> op >> t;
        if(op==0){
            int x;
            cin >> x;
            q.push(t,x);
        }else{
            cout << q.front(t) << "\n";
            q.pop(t);
        }
    }
}

Back to top page