結果
問題 | No.1705 Mode of long array |
ユーザー | harurun |
提出日時 | 2021-09-19 16:19:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,182 ms / 3,000 ms |
コード長 | 4,658 bytes |
コンパイル時間 | 304 ms |
コンパイル使用メモリ | 86,776 KB |
実行使用メモリ | 222,412 KB |
最終ジャッジ日時 | 2023-09-30 09:38:23 |
合計ジャッジ時間 | 46,414 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
70,188 KB |
testcase_01 | AC | 78 ms
70,644 KB |
testcase_02 | AC | 78 ms
70,668 KB |
testcase_03 | AC | 325 ms
80,504 KB |
testcase_04 | AC | 165 ms
79,452 KB |
testcase_05 | AC | 203 ms
79,936 KB |
testcase_06 | AC | 395 ms
86,124 KB |
testcase_07 | AC | 459 ms
85,944 KB |
testcase_08 | AC | 424 ms
85,124 KB |
testcase_09 | AC | 398 ms
85,056 KB |
testcase_10 | AC | 401 ms
85,720 KB |
testcase_11 | AC | 402 ms
85,516 KB |
testcase_12 | AC | 398 ms
84,960 KB |
testcase_13 | AC | 1,038 ms
195,432 KB |
testcase_14 | AC | 817 ms
156,984 KB |
testcase_15 | AC | 742 ms
137,272 KB |
testcase_16 | AC | 847 ms
156,280 KB |
testcase_17 | AC | 678 ms
132,196 KB |
testcase_18 | AC | 641 ms
125,276 KB |
testcase_19 | AC | 919 ms
169,696 KB |
testcase_20 | AC | 713 ms
138,348 KB |
testcase_21 | AC | 796 ms
172,224 KB |
testcase_22 | AC | 1,149 ms
222,412 KB |
testcase_23 | AC | 1,062 ms
126,300 KB |
testcase_24 | AC | 1,003 ms
125,296 KB |
testcase_25 | AC | 1,013 ms
125,800 KB |
testcase_26 | AC | 1,000 ms
124,296 KB |
testcase_27 | AC | 1,074 ms
124,760 KB |
testcase_28 | AC | 1,090 ms
125,992 KB |
testcase_29 | AC | 1,000 ms
126,116 KB |
testcase_30 | AC | 1,014 ms
126,764 KB |
testcase_31 | AC | 1,050 ms
124,128 KB |
testcase_32 | AC | 1,024 ms
123,440 KB |
testcase_33 | AC | 1,098 ms
215,532 KB |
testcase_34 | AC | 1,136 ms
216,004 KB |
testcase_35 | AC | 1,116 ms
217,116 KB |
testcase_36 | AC | 1,115 ms
215,908 KB |
testcase_37 | AC | 1,116 ms
216,112 KB |
testcase_38 | AC | 1,116 ms
216,284 KB |
testcase_39 | AC | 1,110 ms
216,328 KB |
testcase_40 | AC | 1,123 ms
216,448 KB |
testcase_41 | AC | 1,132 ms
216,164 KB |
testcase_42 | AC | 1,139 ms
215,924 KB |
testcase_43 | AC | 549 ms
142,732 KB |
testcase_44 | AC | 575 ms
141,544 KB |
testcase_45 | AC | 577 ms
141,900 KB |
testcase_46 | AC | 612 ms
141,392 KB |
testcase_47 | AC | 595 ms
142,000 KB |
testcase_48 | AC | 598 ms
142,092 KB |
testcase_49 | AC | 1,172 ms
179,024 KB |
testcase_50 | AC | 1,157 ms
178,200 KB |
testcase_51 | AC | 1,170 ms
178,772 KB |
testcase_52 | AC | 1,182 ms
179,528 KB |
testcase_53 | AC | 1,178 ms
177,208 KB |
ソースコード
# multiset: https://tsubo.hatenablog.jp/entry/2020/06/15/124657 from heapq import* def maxheappush(heap,x): heappush(heap,-x) return def maxheappop(heap): return -1*(heappop(heap)) def get_maxheap(heap): return -1*heap[0] class pseudo_set: def __init__(self): self.heap=[] self.di=set() return def insert(self,x): maxheappush(self.heap,x) if x not in self.di: self.di.add(x) return def erase(self,x): self.di.discard(x) while self.heap: p=maxheappop(self.heap) if p in self.di: maxheappush(self.heap,p) break return def get_max(self): while self.heap: p=maxheappop(self.heap) if p in self.di: maxheappush(self.heap,p) break return get_maxheap(self.heap) class pseudo_Multiset: def __init__(self): self.heap=[] self.di=dict() return def insert(self,x): maxheappush(self.heap,x) if x not in self.di: self.di[x]=1 else: self.di[x]+=1 return def erase(self,x): if x in self.di: self.di[x]-=1 if self.di[x]==0: self.di.pop(x) while self.heap: p=maxheappop(self.heap) if p in self.di: maxheappush(self.heap,p) break return def get_max(self): while self.heap: p=maxheappop(self.heap) if p in self.di: maxheappush(self.heap,p) break #print("get_max: ",get_maxheap(self.heap)) return get_maxheap(self.heap) class INPUT: def __init__(self): self._l=open(0).read().split() self._length=len(self._l) self._index=0 return def stream(self,k=1,f=int,f2=False): assert(-1<k) if self._length==self._index or self._length-self._index<k: raise Exception("There is no input!") elif f!=str: if k==0: ret=list(map(f,self._l[self._index:])) self._index=self._length return ret if k==1 and not f2: ret=f(self._l[self._index]) self._index+=1 return ret if k==1 and f2: ret=[f(self._l[self._index])] self._index+=1 return ret ret=[] for _ in [0]*k: ret.append(f(self._l[self._index])) self._index+=1 return ret else: if k==0: ret=list(self._l[self._index:]) self._index=self._length return ret if k==1 and not f2: ret=self._l[self._index] self._index+=1 return ret if k==1 and f2: ret=[self._l[self._index]] self._index+=1 return ret ret=[] for _ in [0]*k: ret.append(self._l[self._index]) self._index+=1 return ret pin=INPUT().stream #pin(number[default:1],f[default:int],f2[default:False]) #if number==0 -> return left all #listを変数で受け取るとき、必ずlistをTrueにすること。 class Mode: def __init__(self,M,um,A): self.place=um self.count=[0]*M self.S=[pseudo_set() for _ in [0]*len(um)] self.max_S=pseudo_Multiset() for i in range(M): self.max_S.insert(0) self.add(i,A[i]) return def add(self,x,y): now=self.count[x] self.S[self.place[now]].erase(x) self.max_S.erase(self.place[now]) self.S[self.place[now+y]].insert(x) self.max_S.insert(self.place[now+y]) self.count[x]+=y return def erase(self,x,y): now=self.count[x] self.S[self.place[now]].erase(x) self.max_S.erase(self.place[now]) self.S[self.place[now-y]].insert(x) self.max_S.insert(self.place[now-y]) self.count[x]-=y return def get(self): max_place=self.max_S.get_max() #print("get: ",self.S[max_place].di) return self.S[max_place].get_max()+1 def debug_count(self): for i in self.count: print(i,end=" ") print() return def debug_max_S(self): print(self.max_S.di) return def debug_S(self): for i in self.S: print(i.di,end=" ") print() return def main(): N,M=pin(2) a=pin(M,int,1) b=a[:] Q=pin(1) query=[] for i in range(Q): t,x,y=pin(3) query.append((t,x,y)) if t==1: b.append(b[x-1]) b[x-1]+=y elif t==2: b.append(b[x-1]) b[x-1]-=y b.append(0) b.sort() place=dict() place[b[0]]=0 cnt=1 #print(0,end=" ") for i in range(1,len(b)): if b[i-1]!=b[i]: #print(b[i],end=" ") place[b[i]]=cnt cnt+=1 #print() mode=Mode(M,place,a) for t,x,y in query: #mode.debug_count() #mode.debug_max_S() #mode.debug_S() if t==1: mode.add(x-1,y) elif t==2: mode.erase(x-1,y) else: print(mode.get()) return main()