結果

問題 No.2077 Get Minimum Algorithm
ユーザー chineristACchineristAC
提出日時 2022-01-04 02:57:55
言語 PyPy3
(7.3.8)
結果
AC  
実行時間 1,272 ms / 3,000 ms
コード長 3,294 bytes
コンパイル時間 481 ms
使用メモリ 131,508 KB
最終ジャッジ日時 2023-01-11 05:31:49
合計ジャッジ時間 34,018 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 112 ms
78,460 KB
testcase_01 AC 111 ms
78,532 KB
testcase_02 AC 113 ms
78,344 KB
testcase_03 AC 185 ms
87,012 KB
testcase_04 AC 198 ms
87,600 KB
testcase_05 AC 187 ms
86,780 KB
testcase_06 AC 184 ms
87,836 KB
testcase_07 AC 187 ms
86,960 KB
testcase_08 AC 203 ms
88,124 KB
testcase_09 AC 189 ms
88,008 KB
testcase_10 AC 181 ms
87,480 KB
testcase_11 AC 186 ms
87,812 KB
testcase_12 AC 1,058 ms
128,156 KB
testcase_13 AC 1,105 ms
128,788 KB
testcase_14 AC 1,047 ms
128,472 KB
testcase_15 AC 1,053 ms
128,340 KB
testcase_16 AC 1,064 ms
128,092 KB
testcase_17 AC 1,069 ms
128,388 KB
testcase_18 AC 1,069 ms
128,428 KB
testcase_19 AC 1,073 ms
129,152 KB
testcase_20 AC 1,044 ms
128,436 KB
testcase_21 AC 1,272 ms
128,296 KB
testcase_22 AC 819 ms
129,440 KB
testcase_23 AC 794 ms
129,492 KB
testcase_24 AC 787 ms
129,532 KB
testcase_25 AC 831 ms
130,396 KB
testcase_26 AC 836 ms
130,992 KB
testcase_27 AC 940 ms
128,332 KB
testcase_28 AC 737 ms
118,920 KB
testcase_29 AC 523 ms
110,940 KB
testcase_30 AC 876 ms
127,796 KB
testcase_31 AC 707 ms
117,472 KB
testcase_32 AC 567 ms
110,664 KB
testcase_33 AC 643 ms
128,928 KB
testcase_34 AC 558 ms
118,912 KB
testcase_35 AC 395 ms
111,340 KB
testcase_36 AC 772 ms
131,508 KB
testcase_37 AC 975 ms
128,212 KB
testcase_38 AC 114 ms
78,300 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class SegmentTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        self.size = n
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        k += self.num
        self.tree[k] = self.segfunc(self.tree[k],x)
        while k > 1:
            k >>= 1
            self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])

    def query(self, l, r):
        if r==self.size:
            r = self.num

        res = self.ide_ele

        l += self.num
        r += self.num
        right = []
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                right.append(self.tree[r-1])
            l >>= 1
            r >>= 1

        for e in right[::-1]:
            res = self.segfunc(res,e)
        return res
    
    def bisect(self,l,r,x):
        if r==self.size:
            r = self.num
        l += self.num
        r += self.num
        segment = []
        segment_r = []
        while l<r:
            if l&1:
                segment.append(l)
                l += 1
            if r&1:
                segment_r.append(r-1)
            l >>= 1
            r >>= 1
        segment += segment_r[::-1]
        tmp = self.ide_ele
        for pos in segment:
            check = self.segfunc(tmp,self.tree[pos])
            if check >= x:
                break
            else:
                tmp = check
        else:
            return -1
        
        while pos < self.num:
            check = self.segfunc(tmp,self.tree[2*pos])
            if check >= x:
                pos = 2 * pos
            else:
                tmp = check
                pos = 2 * pos + 1
        return pos - self.num

import sys,random
from collections import deque

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N = int(input())
P = li()
Q = int(input())
query = [[] for i in range(N+1)]
for i in range(Q):
    x,y = mi()
    query[x].append((y,i))

pos = [-1] * (N+1)
for i in range(N):
    pos[P[i]] = i

fw = SegmentTree([0]*(N+1),lambda x,y:x+y,0)
add_time = [[] for i in range(N+1)]
for i in range(N):
    t = fw.query(0,P[i])
    add_time[t].append(i)
    fw.update(P[i],1)

idx_set = SegmentTree([0]*(N+1),lambda x,y:x+y,0)
val_set = SegmentTree([0]*(N+1),lambda x,y:x+y,0)
cond = [0] * (N+1)
n = 0
for i in add_time[0]:
    idx_set.update(i,1)
    val_set.update(P[i],1)
    cond[P[i]] = 1
    n += 1

ans = [-1]*Q
for t in range(1,N+1):
    idx_set.update(t-1,-1)
    val_set.update(t,-1)
    cond[t] = 2
    n -= 1
    for i in add_time[t]:
        idx_set.update(i,1)
        val_set.update(P[i],1)
        cond[P[i]] = 1
        n += 1
    for y,idx in query[t]:
        if cond[y]==0:
            ans[idx] = pos[y] + 1
        elif cond[y]==1:
            k = val_set.query(0,y+1)
            ans[idx] = idx_set.bisect(0,N+1,n-k+1) + 1

print(*ans,sep="\n")
0