結果

問題 No.2220 Range Insert & Point Mex
ユーザー timitimi
提出日時 2023-02-19 01:44:23
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,562 bytes
コンパイル時間 355 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 139,408 KB
最終ジャッジ日時 2024-07-20 07:11:02
合計ジャッジ時間 29,389 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 153 ms
83,584 KB
testcase_01 AC 156 ms
83,592 KB
testcase_02 AC 150 ms
83,712 KB
testcase_03 WA -
testcase_04 AC 157 ms
83,104 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 157 ms
83,456 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 1,360 ms
137,280 KB
testcase_21 AC 1,269 ms
137,396 KB
testcase_22 AC 1,279 ms
137,056 KB
testcase_23 AC 650 ms
134,500 KB
testcase_24 AC 625 ms
122,328 KB
testcase_25 AC 512 ms
124,536 KB
testcase_26 AC 621 ms
131,160 KB
testcase_27 AC 562 ms
116,256 KB
testcase_28 AC 232 ms
101,372 KB
testcase_29 AC 233 ms
101,940 KB
testcase_30 AC 253 ms
102,112 KB
testcase_31 AC 605 ms
131,440 KB
testcase_32 AC 507 ms
123,492 KB
testcase_33 AC 483 ms
123,364 KB
testcase_34 AC 1,319 ms
129,272 KB
testcase_35 AC 1,191 ms
130,344 KB
testcase_36 AC 1,220 ms
128,820 KB
testcase_37 AC 1,282 ms
129,292 KB
testcase_38 AC 626 ms
130,428 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

N=int(input())
A=[]
for i in range(N):
  l,r,a=map(int,input().split())
  A.append((l,0,a))
  A.append((r,2,a))
M=int(input())
B=list(map(int, input().split()))
c=0
for b in B:
  A.append((b,1,c))
  c+=1
A=sorted(A)
import sys
input = sys.stdin.readlines
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170

    def _build(self, a=None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = self.size = len(a)
        bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
        self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]

    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
            a = sorted(a)
        self._build(a)

    def __iter__(self) -> Iterator[T]:
        for i in self.a:
            for j in i: yield j

    def __reversed__(self) -> Iterator[T]:
        for i in reversed(self.a):
            for j in reversed(i): yield j

    def __len__(self) -> int:
        return self.size

    def __repr__(self) -> str:
        return "SortedMultiset" + str(self.a)

    def __str__(self) -> str:
        s = str(list(self))
        return "{" + s[1 : len(s) - 1] + "}"

    def _find_bucket(self, x: T) -> List[T]:
        "Find the bucket which should contain x. self must not be empty."
        for a in self.a:
            if x <= a[-1]: return a
        return a

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        return i != len(a) and a[i] == x

    def count(self, x: T) -> int:
        "Count the number of x."
        return self.index_right(x) - self.index(x)

    def add(self, x: T) -> None:
        "Add an element. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return
        a = self._find_bucket(x)
        insort(a, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i == len(a) or a[i] != x: return False
        a.pop(i)
        self.size -= 1
        if len(a) == 0: self._build()
        return True

    def lt(self, x: T) -> Union[T, None]:
        "Find the largest element < x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] < x:
                return a[bisect_left(a, x) - 1]

    def le(self, x: T) -> Union[T, None]:
        "Find the largest element <= x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] <= x:
                return a[bisect_right(a, x) - 1]

    def gt(self, x: T) -> Union[T, None]:
        "Find the smallest element > x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] > x:
                return a[bisect_right(a, x)]

    def ge(self, x: T) -> Union[T, None]:
        "Find the smallest element >= x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] >= x:
                return a[bisect_left(a, x)]

    def __getitem__(self, x: int) -> T:
        "Return the x-th element, or IndexError if it doesn't exist."
        if x < 0: x += self.size
        if x < 0: raise IndexError
        for a in self.a:
            if x < len(a): return a[x]
            x -= len(a)
        raise IndexError

    def index(self, x: T) -> int:
        "Count the number of elements < x."
        ans = 0
        for a in self.a:
            if a[-1] >= x:
                return ans + bisect_left(a, x)
            ans += len(a)
        return ans

    def index_right(self, x: T) -> int:
        "Count the number of elements <= x."
        ans = 0
        for a in self.a:
            if a[-1] > x:
                return ans + bisect_right(a, x)
            ans += len(a)
        return ans

st = SortedMultiset()

for i in range(10**5+1):
  st.add(i)
ans=[]
for a,b,c in A:
  if b==0:
    st.discard(c)
  elif b==1:
    ans.append(st[0])
  else:
    st.add(c)
for i in ans:
  print(i)
0