結果

問題 No.2220 Range Insert & Point Mex
ユーザー ニックネームニックネーム
提出日時 2023-02-17 23:02:28
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,896 bytes
コンパイル時間 160 ms
コンパイル使用メモリ 82,520 KB
実行使用メモリ 134,900 KB
最終ジャッジ日時 2024-07-19 14:15:20
合計ジャッジ時間 15,272 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
67,584 KB
testcase_01 AC 65 ms
67,456 KB
testcase_02 AC 65 ms
67,584 KB
testcase_03 AC 66 ms
68,224 KB
testcase_04 AC 66 ms
67,584 KB
testcase_05 AC 67 ms
68,352 KB
testcase_06 AC 65 ms
68,096 KB
testcase_07 AC 66 ms
67,968 KB
testcase_08 AC 67 ms
68,224 KB
testcase_09 AC 67 ms
68,736 KB
testcase_10 AC 67 ms
68,224 KB
testcase_11 AC 64 ms
67,968 KB
testcase_12 AC 65 ms
68,096 KB
testcase_13 AC 543 ms
125,440 KB
testcase_14 AC 546 ms
125,568 KB
testcase_15 AC 542 ms
125,568 KB
testcase_16 AC 546 ms
125,696 KB
testcase_17 AC 552 ms
125,568 KB
testcase_18 AC 552 ms
126,032 KB
testcase_19 AC 553 ms
125,440 KB
testcase_20 AC 387 ms
121,928 KB
testcase_21 AC 385 ms
121,856 KB
testcase_22 AC 382 ms
121,856 KB
testcase_23 WA -
testcase_24 AC 408 ms
112,128 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 279 ms
113,104 KB
testcase_30 AC 268 ms
113,084 KB
testcase_31 AC 398 ms
122,596 KB
testcase_32 AC 369 ms
119,424 KB
testcase_33 AC 483 ms
119,680 KB
testcase_34 AC 499 ms
126,860 KB
testcase_35 AC 625 ms
126,940 KB
testcase_36 AC 496 ms
123,620 KB
testcase_37 AC 621 ms
123,536 KB
testcase_38 AC 705 ms
134,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, TypeVar, Optional, List
T = TypeVar('T')

class SortedSet(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 SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
        a = list(a)
        if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
            a = sorted(set(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 "SortedSet" + 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 add(self, x: T) -> bool:
        "Add an element and return True if added. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return True
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i != len(a) and a[i] == x: return False
        a.insert(i, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()
        return True

    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) -> Optional[T]:
        "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) -> Optional[T]:
        "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) -> Optional[T]:
        "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) -> Optional[T]:
        "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
    
n = int(input())
alr = [[(0,0),(10**9+1,10**9+1)] for _ in range(n+1)]
for _ in range(n):
    l,r,a = map(int,input().split())
    if a<=n: alr[a].append((l,r))
ans = [0]*int(input())
x = list(map(int,input().split()))
d = {v:i for i,v in enumerate(x)}
ss = SortedSet(x)
for a in range(n):
    lr = []
    for l,r in sorted(alr[a]):
        if not lr or lr[-1][1]+1<l: lr.append([l,r])
        else: lr[-1][1] = max(lr[-1][1],r)
    for (_,r),(l,_) in zip(lr[:-1],lr[1:]):
        jl = ss.index_right(r)
        jr = ss.index(l)-1
        for j in range(jr,jl-1,-1):
            v = ss[j]
            ss.discard(v)
            ans[d[v]] = a
    if len(ss)==0: break
print(*ans,sep="\n")
0