Submission #32056927

Source Code Expand

import heapq from collections import defaultdict mx=[] mn=[] cnt=defaultdict(int) q=int(input()) for _ in range(q): query=list(map(int,input().split())) if query[0]==1: x=query[1] cnt[x]+=1 heapq.heappush(mx,-x) heapq.heappush(mn,x) if query[0]==2: x,c=query[1:] cnt[x]=max(0,cnt[x]-c) if query[0]==3: while cnt[-mx[0]]==0: heapq.heappop(mx) while cnt[mn[0]]==0: heapq.heappop(mn) print(-mx[0]-mn[0])

Submission Info

Submission Time
Task C - Max - Min Query
User toam
Language PyPy3 (7.3.0)
Score 300
Code Size 485 Byte
Status AC
Exec Time 725 ms
Memory 117884 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 20
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 02_killer_01.txt, 02_killer_02.txt, 02_killer_03.txt, 02_killer_04.txt, 02_killer_05.txt, 02_killer_06.txt, 02_killer_07.txt, 02_killer_08.txt, 02_killer_09.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 67 ms 64652 KiB
00_sample_02.txt AC 47 ms 64708 KiB
01_random_01.txt AC 465 ms 88020 KiB
01_random_02.txt AC 582 ms 85176 KiB
01_random_03.txt AC 605 ms 84284 KiB
01_random_04.txt AC 615 ms 82324 KiB
01_random_05.txt AC 594 ms 83808 KiB
01_random_06.txt AC 605 ms 83636 KiB
01_random_07.txt AC 567 ms 90228 KiB
01_random_08.txt AC 571 ms 90212 KiB
01_random_09.txt AC 725 ms 108332 KiB
02_killer_01.txt AC 488 ms 116492 KiB
02_killer_02.txt AC 492 ms 115132 KiB
02_killer_03.txt AC 497 ms 117884 KiB
02_killer_04.txt AC 329 ms 92024 KiB
02_killer_05.txt AC 324 ms 92880 KiB
02_killer_06.txt AC 327 ms 94268 KiB
02_killer_07.txt AC 328 ms 97228 KiB
02_killer_08.txt AC 325 ms 97768 KiB
02_killer_09.txt AC 327 ms 100236 KiB