結果

問題 No.2220 Range Insert & Point Mex
ユーザー ShirotsumeShirotsume
提出日時 2023-02-14 08:09:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 948 ms / 2,000 ms
コード長 5,762 bytes
コンパイル時間 1,462 ms
コンパイル使用メモリ 87,040 KB
実行使用メモリ 150,596 KB
最終ジャッジ日時 2023-09-28 17:57:55
合計ジャッジ時間 22,033 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 174 ms
77,884 KB
testcase_01 AC 176 ms
77,804 KB
testcase_02 AC 174 ms
77,864 KB
testcase_03 AC 175 ms
77,684 KB
testcase_04 AC 173 ms
77,904 KB
testcase_05 AC 173 ms
77,800 KB
testcase_06 AC 175 ms
77,580 KB
testcase_07 AC 172 ms
77,864 KB
testcase_08 AC 173 ms
77,580 KB
testcase_09 AC 174 ms
77,484 KB
testcase_10 AC 174 ms
77,808 KB
testcase_11 AC 173 ms
77,756 KB
testcase_12 AC 173 ms
77,884 KB
testcase_13 AC 706 ms
146,044 KB
testcase_14 AC 697 ms
146,000 KB
testcase_15 AC 695 ms
145,904 KB
testcase_16 AC 714 ms
149,848 KB
testcase_17 AC 701 ms
148,524 KB
testcase_18 AC 689 ms
145,984 KB
testcase_19 AC 697 ms
146,392 KB
testcase_20 AC 580 ms
136,624 KB
testcase_21 AC 578 ms
137,060 KB
testcase_22 AC 582 ms
136,852 KB
testcase_23 AC 702 ms
150,596 KB
testcase_24 AC 608 ms
139,948 KB
testcase_25 AC 595 ms
129,848 KB
testcase_26 AC 529 ms
148,288 KB
testcase_27 AC 440 ms
130,272 KB
testcase_28 AC 228 ms
110,124 KB
testcase_29 AC 359 ms
112,448 KB
testcase_30 AC 359 ms
112,216 KB
testcase_31 AC 620 ms
145,520 KB
testcase_32 AC 601 ms
134,592 KB
testcase_33 AC 639 ms
135,104 KB
testcase_34 AC 746 ms
141,856 KB
testcase_35 AC 777 ms
141,972 KB
testcase_36 AC 733 ms
141,712 KB
testcase_37 AC 774 ms
141,944 KB
testcase_38 AC 948 ms
147,828 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