結果
問題 | No.2077 Get Minimum Algorithm |
ユーザー | chineristAC |
提出日時 | 2022-01-04 02:57:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,183 ms / 3,000 ms |
コード長 | 3,294 bytes |
コンパイル時間 | 668 ms |
コンパイル使用メモリ | 87,376 KB |
実行使用メモリ | 127,728 KB |
最終ジャッジ日時 | 2023-08-23 14:06:30 |
合計ジャッジ時間 | 33,639 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 111 ms
74,312 KB |
testcase_01 | AC | 108 ms
74,176 KB |
testcase_02 | AC | 109 ms
74,372 KB |
testcase_03 | AC | 187 ms
82,564 KB |
testcase_04 | AC | 182 ms
82,864 KB |
testcase_05 | AC | 177 ms
82,816 KB |
testcase_06 | AC | 174 ms
82,648 KB |
testcase_07 | AC | 174 ms
82,324 KB |
testcase_08 | AC | 190 ms
82,648 KB |
testcase_09 | AC | 177 ms
83,216 KB |
testcase_10 | AC | 166 ms
82,468 KB |
testcase_11 | AC | 178 ms
83,516 KB |
testcase_12 | AC | 1,124 ms
124,812 KB |
testcase_13 | AC | 1,134 ms
124,020 KB |
testcase_14 | AC | 1,128 ms
123,440 KB |
testcase_15 | AC | 1,129 ms
123,512 KB |
testcase_16 | AC | 1,113 ms
123,360 KB |
testcase_17 | AC | 1,120 ms
124,292 KB |
testcase_18 | AC | 1,177 ms
123,532 KB |
testcase_19 | AC | 1,183 ms
123,448 KB |
testcase_20 | AC | 1,171 ms
123,796 KB |
testcase_21 | AC | 1,121 ms
123,248 KB |
testcase_22 | AC | 832 ms
125,548 KB |
testcase_23 | AC | 820 ms
125,884 KB |
testcase_24 | AC | 806 ms
126,192 KB |
testcase_25 | AC | 838 ms
125,888 KB |
testcase_26 | AC | 842 ms
126,148 KB |
testcase_27 | AC | 931 ms
123,892 KB |
testcase_28 | AC | 727 ms
114,692 KB |
testcase_29 | AC | 503 ms
104,980 KB |
testcase_30 | AC | 881 ms
122,336 KB |
testcase_31 | AC | 715 ms
112,560 KB |
testcase_32 | AC | 551 ms
105,312 KB |
testcase_33 | AC | 641 ms
122,508 KB |
testcase_34 | AC | 482 ms
114,064 KB |
testcase_35 | AC | 373 ms
105,800 KB |
testcase_36 | AC | 792 ms
127,728 KB |
testcase_37 | AC | 1,010 ms
123,424 KB |
testcase_38 | AC | 109 ms
74,556 KB |
ソースコード
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")