結果

問題 No.3167 [Cherry 7th Tune C] Cut in Queue
コンテスト
ユーザー mkawa2
提出日時 2025-05-31 01:07:41
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,928 bytes
コンパイル時間 621 ms
コンパイル使用メモリ 82,160 KB
実行使用メモリ 322,044 KB
最終ジャッジ日時 2025-05-31 01:08:19
合計ジャッジ時間 37,854 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 5 WA * 38
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import defaultdict, Counter
from heapq import *

class BitSum:
    def __init__(self, n):
        self._n = n+1
        self._table = [0]*self._n

    def add(self, i, x):
        if x == 0: return
        i += 1
        while i < self._n:
            self._table[i] += x
            i += i & -i

    def sum(self, r):
        res = 0
        while r > 0:
            res += self._table[r]
            r -= r & -r
        return res

    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r)
        return self.sum(r)-self.sum(l)

    # return "min(i) of sum(a[0]..a[i])>=x" or "N"
    def bisect(self, x):
        idx = 0
        d = 1 << (self._n-1).bit_length()-1
        while d:
            if idx | d < self._n and self._table[idx | d] < x:
                idx |= d
                x -= self._table[idx]
            d >>= 1
        return idx

n = II()
aa = LI()
# print(aa)
b = n+1
top = 0

a2i = {a: i for i, a in enumerate(aa)}
bb = [[] for _ in range(n+1)]
deg = Counter()
to = defaultdict(list)
query = []
for _ in range(II()):
    ta = LI()
    if ta[0] == 1:
        a = ta[1]
        if a:
            i = a2i[a]
            if a > n:
                to[b].append(a)
                deg[a] += 1
        else:
            i = n
        a2i[b] = i
        bb[i].append(b)
        b += 1
        query.append(ta)
    elif ta[0] == 2:
        query.append((2, 0))
    else:
        query.append(ta)
# print(bb)
# print(to)

cc = [[] for _ in range(n)]
for i in range(n):
    hp = []
    for b in bb[i]:
        if deg[b] == 0: heappush(hp, b)
    while hp:
        b = heappop(hp)
        cc[i].append(b)
        for nb in to[b]:
            deg[nb] -= 1
            if deg[nb] == 0:
                heappush(hp, nb)
    cc[i].append(aa[i])
cc.append(bb[-1])

bb = []
for c in cc: bb += c

m = len(bb)
bit = BitSum(m)
b2i = {}
for i, b in enumerate(bb):
    b2i[b] = i
    if b <= n: bit.add(i, 1)

b = n+1
top = 0
for t, a in query:
    if t == 1:
        i = b2i[b]
        bit.add(i, 1)
        b += 1
    elif t == 2:
        top += 1
    else:
        i = bit.bisect(a+top)
        print(bb[i])
0