結果
| 問題 | No.674 n連勤 |
| ユーザー |
 norioc
|
| 提出日時 | 2024-11-20 03:22:23 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 529 ms / 2,000 ms |
| コード長 | 5,454 bytes |
| コンパイル時間 | 467 ms |
| コンパイル使用メモリ | 82,704 KB |
| 実行使用メモリ | 84,572 KB |
| 最終ジャッジ日時 | 2024-11-20 03:22:28 |
| 合計ジャッジ時間 | 4,943 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 66 ms
69,464 KB |
| testcase_01 | AC | 59 ms
69,312 KB |
| testcase_02 | AC | 60 ms
69,408 KB |
| testcase_03 | AC | 58 ms
68,332 KB |
| testcase_04 | AC | 59 ms
68,744 KB |
| testcase_05 | AC | 66 ms
68,120 KB |
| testcase_06 | AC | 60 ms
69,268 KB |
| testcase_07 | AC | 66 ms
67,920 KB |
| testcase_08 | AC | 58 ms
68,192 KB |
| testcase_09 | AC | 59 ms
68,244 KB |
| testcase_10 | AC | 58 ms
68,508 KB |
| testcase_11 | AC | 111 ms
78,464 KB |
| testcase_12 | AC | 146 ms
79,620 KB |
| testcase_13 | AC | 169 ms
79,080 KB |
| testcase_14 | AC | 216 ms
79,232 KB |
| testcase_15 | AC | 190 ms
79,524 KB |
| testcase_16 | AC | 340 ms
82,192 KB |
| testcase_17 | AC | 340 ms
82,092 KB |
| testcase_18 | AC | 529 ms
84,572 KB |
| testcase_19 | AC | 170 ms
78,576 KB |
ソースコード
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 = 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 __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
import sys
sys.setrecursionlimit(10 ** 6)
class RangeSet:
def __init__(self):
inf = 1 << 60
self.ss = SortedSet()
self.ss.add((inf*2, inf)) # (r, l)
def _overlap(self, l1, r1, l2, r2) -> int:
"""二つの半開区間 [l1, r1), [l2, r2) の重なりを求める"""
assert l1 < r1 and l2 < r2
start = max(l1, l2)
end = min(r1, r2)
return max(0, end - start)
def merge(self, l: int, r: int) -> tuple[int, int, int]:
"""半開区間 [l, r) をマージする。
マージ後の半開区間と、入力 [l, r) との重なり幅を返す
"""
assert 0 <= l < r
t = self.ss.ge((l, -1))
assert t is not None
sr, sl = t # [sl, sr)
if r < sl:
self.ss.add((r, l))
return l, r, 0
if sl <= l and r <= sr:
return sl, sr, r-l
self.ss.discard(t)
start = min(l, sl)
if r <= sr:
self.ss.add((sr, start))
return start, sr, r-sl
tl, tr, dup = self.merge(start, r)
return tl, tr, dup + self._overlap(l, r, t[1], t[0])
D, Q = map(int, input().split())
range_set = RangeSet()
ans = 0
for _ in range(Q):
A, B = map(int, input().split())
l, r, _ = range_set.merge(A, B+1)
ans = max(ans, r-l)
print(ans)