#1002084 (PyPy3) No.674 n連勤

• 問題: No.674 n連勤
• ユーザー: titia
• 提出日時: 2024-08-16 04:19:07
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 440 ms / 2,000 ms
• コード長: 5,774 bytes
• コンパイル時間: 394 ms
• コンパイル使用メモリ: 82,828 KB
• 実行使用メモリ: 85,652 KB
• 最終ジャッジ日時: 2024-08-16 04:19:12
• 合計ジャッジ時間: 4,870 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	57 ms; 69,516 KB
testcase_01	AC	59 ms; 68,768 KB
testcase_02	AC	62 ms; 69,060 KB
testcase_03	AC	59 ms; 68,196 KB
testcase_04	AC	60 ms; 69,032 KB
testcase_05	AC	57 ms; 68,724 KB
testcase_06	AC	58 ms; 67,972 KB
testcase_07	AC	59 ms; 69,176 KB
testcase_08	AC	57 ms; 69,336 KB
testcase_09	AC	60 ms; 69,216 KB
testcase_10	AC	57 ms; 68,776 KB
testcase_11	AC	127 ms; 79,424 KB
testcase_12	AC	208 ms; 80,532 KB
testcase_13	AC	112 ms; 78,960 KB
testcase_14	AC	163 ms; 79,772 KB
testcase_15	AC	263 ms; 80,860 KB
testcase_16	AC	378 ms; 85,340 KB
testcase_17	AC	351 ms; 85,652 KB
testcase_18	AC	440 ms; 85,096 KB
testcase_19	AC	164 ms; 80,068 KB

ソースコード

import sys
input = sys.stdin.readline

# 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, List, Tuple, TypeVar, Optional
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) -> 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, 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

D,Q=map(int,input().split())
S=SortedSet()
ANS=0
for i in range(Q):
    A,B=map(int,input().split())
    S.add((A,B))

    k=S.index((A,B))
    ANS=max(ANS,B-A+1)

    while k>=1:
        z,w=S[k-1]

        if A<=w+1:
            p=min(A,z)
            q=max(B,w)

            S.discard((A,B))
            S.discard((z,w))
            S.add((p,q))
            ANS=max(ANS,q-p+1)
            k-=1
            A=p
            B=q
        else:
            break

    k=S.index((A,B))
    ANS=max(ANS,B-A+1)

    while k<len(S)-1:
        z,w=S[k+1]

        if z<=B+1:
            p=min(A,z)
            q=max(B,w)

            S.discard((A,B))
            S.discard((z,w))
            S.add((p,q))
            ANS=max(ANS,q-p+1)
            A=p
            B=q
        else:
            break

    print(ANS)