結果

問題 No.3167 [Cherry 7th Tune C] Cut in Queue
コンテスト
ユーザー hato336
提出日時 2025-05-30 22:05:56
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 5,689 bytes
コンパイル時間 442 ms
コンパイル使用メモリ 82,236 KB
実行使用メモリ 214,860 KB
最終ジャッジ日時 2025-05-30 22:06:39
合計ジャッジ時間 37,809 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 42 RE * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
#n = int(input())
#a = list(map(int,input().split()))
#a = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    a.append(list(map(int,input().split())))
#https://github.com/shakayami/ACL-for-python/blob/master/segtree.py
class segtree():
    n=1
    size=1
    log=2
    d=[0]
    op=None
    e=10**15
    def __init__(self,V,OP,E):
        self.n=len(V)
        self.op=OP
        self.e=E
        self.log=(self.n-1).bit_length()
        self.size=1<<self.log
        self.d=[E for i in range(2*self.size)]
        for i in range(self.n):
            self.d[self.size+i]=V[i]
        for i in range(self.size-1,0,-1):
            self.update(i)
    def set(self,p,x):
        assert 0<=p and p<self.n
        p+=self.size
        self.d[p]=x
        for i in range(1,self.log+1):
            self.update(p>>i)
    def get(self,p):
        assert 0<=p and p<self.n
        return self.d[p+self.size]
    def prod(self,l,r):
        assert 0<=l and l<=r and r<=self.n
        sml=self.e
        smr=self.e
        l+=self.size
        r+=self.size
        while(l<r):
            if (l&1):
                sml=self.op(sml,self.d[l])
                l+=1
            if (r&1):
                smr=self.op(self.d[r-1],smr)
                r-=1
            l>>=1
            r>>=1
        return self.op(sml,smr)
    def all_prod(self):
        return self.d[1]
    def max_right(self,l,f):
        assert 0<=l and l<=self.n
        assert f(self.e)
        if l==self.n:
            return self.n
        l+=self.size
        sm=self.e
        while(1):
            while(l%2==0):
                l>>=1
            if not(f(self.op(sm,self.d[l]))):
                while(l<self.size):
                    l=2*l
                    if f(self.op(sm,self.d[l])):
                        sm=self.op(sm,self.d[l])
                        l+=1
                return l-self.size
            sm=self.op(sm,self.d[l])
            l+=1
            if (l&-l)==l:
                break
        return self.n
    def min_left(self,r,f):
        assert 0<=r and r<=self.n
        assert f(self.e)
        if r==0:
            return 0
        r+=self.size
        sm=self.e
        while(1):
            r-=1
            while(r>1 and (r%2)):
                r>>=1
            if not(f(self.op(self.d[r],sm))):
                while(r<self.size):
                    r=(2*r+1)
                    if f(self.op(self.d[r],sm)):
                        sm=self.op(self.d[r],sm)
                        r-=1
                return r+1-self.size
            sm=self.op(self.d[r],sm)
            if (r& -r)==r:
                break
        return 0
    def update(self,k):
        self.d[k]=self.op(self.d[2*k],self.d[2*k+1])
    def __str__(self):
        return str([self.get(i) for i in range(self.n)])
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = collections.defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return ''.join(f'{r}: {m}' for r, m in self.all_group_members().items())
n = int(input())
a = list(map(int,input().split()))
q = int(input())
query = []
b = [-1 for i in range(n+q+10)]
f = [-1 for i in range(n+q+10)]
for i in range(n):
    if i != 0:
        b[a[i]] = a[i-1]
    if i != n-1:
        f[a[i]] = a[i+1]
now = n+1
end = a[-1]
for i in range(q):
    t = list(map(int,input().split()))
    query.append(t)
    if t[0] == 1:
        t,v = t
        if v == 0:
            f[end] = now
            b[now] = end
            end = now
        else:
            x = v
            y = b[x]
            #y now x
            f[y] = now
            b[now] = y
            f[now] = x
            b[x] = now
        now += 1
c = []
now = a[0]
while now != -1:
    c.append(now)
    now = f[now]
#print(c)

st = segtree([0 for i in range(len(c))],operator.add,0)
d = [-1 for i in range(n+q+10)]
for i in range(len(c)):
    d[c[i]] = i

for i in a:
    idx = d[i]
    st.set(idx,1)
now = n+1

for i in range(q):
    t = query[i]
    if t[0] == 1:
        t,v = t
        idx = d[now]
        #print(idx)
        st.set(idx,1)
        now += 1
    elif t[0] == 2:
        def f(z):
            if z >= 1:
                return 0
            else:
                return 1
        y = st.max_right(0,f)
        st.set(y,0)
    else:
        t,k = t
        def f(z):
            if z >= k:
                return 0
            else:
                return 1
        y = st.max_right(0,f)
        print(c[y])
0