CPMagical CP Library

Problem solution · Python

ABC459 C — Drop Blocks

ABC459 C — Drop Blocks: a Python solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to KATO-Hiro AtCoder Solutions.

Technique
Sorting and greedy selection
Source
KATO-Hiro AtCoder Solutions
Length
212 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For ABC459 C — Drop Blocks, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 212 lines of Python from the credited upstream file abc459_c.py.
  • The implementation visibly relies on sequence storage, ordered lookup.
  • No explicit loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from KATO-Hiro AtCoder Solutions by KATO-Hiro and is used under the CC0-1.0 licence.

Open problem ↗Original source ↗
Full codeABC459 C — Drop Blocks · PythonPython
Use this to learn the idea, then write your own version.
# -*- coding: utf-8 -*- # See:# https://github.com/tatyam-prime/SortedSet/blob/main/codon/SortedMultiset.pyimport mathfrom bisect import bisect_left, bisect_rightfrom typing import ClassVar, Generator, Optional  class SortedMultiset[T]:    size: int    a: list[list[T]]    BUCKET_RATIO: ClassVar[int] = 16    SPLIT_RATIO: ClassVar[int] = 24     def __init__(self) -> None:        self.size = 0        self.a = []     def __init__(self, a: Generator[T]) -> None:        self.__init__(list(a))     def __init__(self, a: list[T]) -> None:        "Make a new SortedMultiset from a list. / O(N) if sorted / O(N log N)"        n = self.size = len(a)        if any(a[i] > a[i + 1] for i in range(n - 1)):            a.sort()        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) -> Generator[T]:        for i in self.a:            for j in i:                yield j     def __reversed__(self) -> Generator[T]:        for i in reversed(self.a):            for j in reversed(i):                yield j     def __eq__(self, other: SortedMultiset[T]) -> bool:        if len(self) != len(other):            return False        for x, y in zip(self, other):            if x != y:                return False        return True     def __ne__(self, other: SortedMultiset[T]) -> bool:        return not self.__eq__(other)     def __len__(self) -> int:        return self.size     def __bool__(self) -> bool:        return self.size > 0     def __repr__(self) -> str:        return "SortedMultiset" + 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 count(self, x: T) -> int:        "Count the number of x."        return self.index_right(x) - self.index(x)     def add(self, x: T) -> None:        "Add an element. / O(√N)"        if self.size == 0:            self.a = [[x]]            self.size = 1            return        a, b, i = self._position(x)        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:]]     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("index out of range")     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("index out of range")     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 main():    n, q = list(map(int, input().split()))    counts = [0] * n    st = SortedMultiset([0] * n)    ans = list()     for _ in range(q):        query, value = list(map(int, input().split()))         if query == 1:            value -= 1             st.discard(counts[value])            counts[value] += 1            st.add(counts[value])        else:            add = st[0]            result = n - st.index(value + add)            ans.append(result)     for ans_i in ans:        print(ans)  if __name__ == "__main__":    main()

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗