#1172538 (PyPy3) No.2930 Larger Mex

• 問題: No.2930 Larger Mex
• ユーザー: 回転
• 提出日時: 2026-07-22 19:24:36
• 言語: PyPy3 (7.3.17)
• 結果: AC
• 実行時間: 1,168 ms / 2,000 ms
• コード長: 8,852 bytes
• コンパイル時間: 237 ms
• コンパイル使用メモリ: 96,428 KB
• 実行使用メモリ: 158,780 KB
• 最終ジャッジ日時: 2026-07-22 19:25:09
• 合計ジャッジ時間: 30,656 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge3_0

ファイルパターン	結果
sample	AC * 3
other	AC * 50

ソースコード

# 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
T = TypeVar('T')

class SortedSet(Generic[T]):
    BUCKET_RATIO = 16
    SPLIT_RATIO = 24
    
    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)
        n = len(a)
        if any(a[i] > a[i + 1] for i in range(n - 1)):
            a.sort()
        if any(a[i] >= a[i + 1] for i in range(n - 1)):
            a, b = [], a
            for x in b:
                if not a or a[-1] != x:
                    a.append(x)
        n = self.size = len(a)
        num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
        self.a = [a[n * i // num_bucket : n * (i + 1) // num_bucket] for i in range(num_bucket)]

    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 __eq__(self, other) -> bool:
        return list(self) == list(other)
    
    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 _position(self, x: T) -> tuple[list[T], int, int]:
        "return the bucket, index of the bucket and position in which x should be. self must not be empty."
        for i, a in enumerate(self.a):
            if x <= a[-1]: break
        return (a, i, bisect_left(a, x))

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a, _, i = self._position(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, b, i = self._position(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.SPLIT_RATIO:
            mid = len(a) >> 1
            self.a[b:b+1] = [a[:mid], a[mid:]]
        return True
    
    def _pop(self, a: list[T], b: int, i: int) -> T:
        ans = a.pop(i)
        self.size -= 1
        if not a: del self.a[b]
        return ans

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0: return False
        a, b, i = self._position(x)
        if i == len(a) or a[i] != x: return False
        self._pop(a, b, i)
        return True
    
    def lt(self, x: T) -> 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) -> 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) -> 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) -> 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, i: int) -> T:
        "Return the i-th element."
        if i < 0:
            for a in reversed(self.a):
                i += len(a)
                if i >= 0: return a[i]
        else:
            for a in self.a:
                if i < len(a): return a[i]
                i -= len(a)
        raise IndexError
    
    def pop(self, i: int = -1) -> T:
        "Pop and return the i-th element."
        if i < 0:
            for b, a in enumerate(reversed(self.a)):
                i += len(a)
                if i >= 0: return self._pop(a, ~b, i)
        else:
            for b, a in enumerate(self.a):
                if i < len(a): return self._pop(a, b, i)
                i -= 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

class Pairset():
    data = None
    
    def __init__(self) -> None:
        self.data = SortedSet()
        self.data.add((-10**18, -10**18))
        self.data.add((10**18, 10**18))
    
    def contains(self, x):
        idx = self.data.index_right((x, 10**18)) - 1
        L_start, L_end = self.data[idx]
        return x < L_end
    
    def add(self, x):
        idx = self.data.index_right((x, 10**18)) - 1
        L_start, L_end = self.data[idx]
        R_start, R_end = self.data[idx+1]
        if x < L_end:
            return False
        if L_end < x and x + 1 < R_start:
            self.data.add((x, x + 1))
        elif L_end == x and x + 1 < R_start:
            self.data.pop(idx)
            self.data.add((L_start, x + 1))
        elif L_end < x and x + 1 == R_start:
            self.data.pop(idx + 1)
            self.data.add((x, R_end))
        else:
            self.data.pop(idx + 1)
            self.data.pop(idx)
            self.data.add((L_start, R_end))
        return True
    
    def mex(self, x):
        idx = self.data.index_right((x, 10**18)) - 1
        L_start, L_end = self.data[idx]
        if L_end <= x:
            return x
        else:
            return L_end
        
    def expand(self, x):
        idx = self.data.index_right((x, 10**18)) - 1
        L_start, L_end = self.data[idx]
        if L_end <= x:
            return x, x            
        else:
            return L_start, L_end
    
    def remove(self, x):
        idx = self.data.index_right((x, 10**18)) - 1
        L_start, L_end = self.data[idx]
        if L_end <= x:
            return False
        self.data.pop(idx)
        if L_start < x:
            self.data.add((L_start, x))
        if x + 1 < L_end:
            self.data.add((x + 1, L_end))
        return True

    def add_interval(self, xL: int, xR: int) -> int:
        if xL >= xR:
            return 0
            
        idx = self.data.index_right((xL, 10**18)) - 1
        if idx >= 0:
            L_start, L_end = self.data[idx]
            if L_end < xL:
                idx += 1
        else:
            idx = 0

        removed_len = 0
        while idx < len(self.data):
            L_start, L_end = self.data[idx]
            if L_start > xR:
                break
            
            xL = min(xL, L_start)
            xR = max(xR, L_end)
            removed_len += L_end - L_start
            self.data.pop(idx)

        self.data.add((xL, xR))
        return (xR - xL) - removed_len

    def remove_interval(self, xL: int, xR: int) -> int:
        if xL >= xR:
            return 0
            
        idx = self.data.index_right((xL, 10**18)) - 1
        if idx >= 0:
            L_start, L_end = self.data[idx]
            if L_end <= xL:
                idx += 1
        else:
            idx = 0

        removed_count = 0
        while idx < len(self.data):
            L_start, L_end = self.data[idx]
            if L_start >= xR:
                break
            
            overlap_start = max(L_start, xL)
            overlap_end = min(L_end, xR)
            removed_count += overlap_end - overlap_start
            
            self.data.pop(idx)
            
            if L_start < xL:
                self.data.add((L_start, xL))
                idx += 1
            if xR < L_end:
                self.data.add((xR, L_end))

        return removed_count

from collections import defaultdict
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
imos = [0] * (N+2)

count = defaultdict(int)
PS = Pairset()
right = 0
for left in range(N):
    if(left > right):right = left
    while(right < N and PS.mex(0) < M):
        PS.add(A[right])
        count[A[right]] += 1
        right += 1
    
    if(PS.mex(0) >= M):
        imos[right - left] += 1
        imos[N+1 - left] -= 1
    
    count[A[left]] -= 1
    if(count[A[left]] == 0):PS.remove(A[left])

for i in range(N+1):imos[i+1] += imos[i]

for i in imos[1:-1]:
    print(i)