結果

問題 No.2220 Range Insert & Point Mex
ユーザー ShirotsumeShirotsume
提出日時 2023-02-14 08:07:15
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 5,762 bytes
コンパイル時間 634 ms
コンパイル使用メモリ 86,580 KB
実行使用メモリ 127,836 KB
最終ジャッジ日時 2023-09-23 17:57:15
合計ジャッジ時間 23,572 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 166 ms
77,156 KB
testcase_01 AC 165 ms
77,516 KB
testcase_02 AC 163 ms
77,468 KB
testcase_03 RE -
testcase_04 AC 164 ms
77,512 KB
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 AC 527 ms
118,780 KB
testcase_21 AC 531 ms
118,900 KB
testcase_22 AC 529 ms
118,740 KB
testcase_23 AC 619 ms
127,836 KB
testcase_24 AC 525 ms
117,464 KB
testcase_25 AC 540 ms
121,776 KB
testcase_26 AC 464 ms
127,000 KB
testcase_27 AC 386 ms
108,572 KB
testcase_28 AC 224 ms
109,628 KB
testcase_29 AC 355 ms
112,288 KB
testcase_30 AC 357 ms
112,036 KB
testcase_31 AC 563 ms
127,656 KB
testcase_32 AC 557 ms
118,044 KB
testcase_33 AC 581 ms
118,712 KB
testcase_34 AC 662 ms
122,236 KB
testcase_35 AC 686 ms
122,184 KB
testcase_36 AC 647 ms
122,316 KB
testcase_37 AC 684 ms
121,736 KB
testcase_38 AC 866 ms
126,752 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353
# 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, Union, List
T = TypeVar('T')

class SortedSet(Generic[T]):
    BUCKET_RATIO = 20
    REBUILD_RATIO = 600

    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) -> 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
def merger(intervals):
    intervals.sort(key=lambda interval: interval[0])
    merged = [intervals[0]]
    for w in intervals:
        if w[0] > merged[-1][1]:
            merged.append(w)
        elif w[1] > merged[-1][1]:
            merged[-1][1] = w[1]
    return merged
#クエリをaの昇順にソートする．
#a >= Nであるものは無視して良く，a = 0, 1, 2,... を仮定する．

#各aについて，いくつか区間があって，その区間の和集合に含まれなかった奴はmexがaとして脱落
#区間数がO(K)なら，その補集合の個数？みたいなやつもO(K)
#setなどを用いて管理していけば，それぞれの要素がいつ落ちるかだけ分かればよい

n = ii()
LR = [[(-2, -1), (10 ** 9 + 1, 10 ** 9 + 2)] for _ in range(n)]
for _ in range(n):
    l, r, a = mi()
    if a < n:
        LR[a].append((l, r))

q = ii()
x = li()
d = {}
for v in x:
    d[v] = n
S = SortedSet(x)
for i in range(n):
    LR[i] = merger(LR[i])
    for idx in range(len(LR[i]) - 1):
        l, r = LR[i][idx][1] + 1, LR[i][idx + 1][0] - 1
        while S:
            to = S.ge(l)
            if to is None:
                break
            if to <= r:
                S.discard(to)
                d[to] = i
            else:
                break
for v in x:
    print(d[v])
0