ABC277 D — Takahashi's Solitaire

1# -*- coding: utf-8 -*-2 3 4class UnionFind:5    '''Represents a data structure that tracks a set of elements partitioned6       into a number of disjoint (non-overlapping) subsets.7    Landau notation: O(α(n)), where α(n) is the inverse Ackermann function.8    See:9    https://www.youtube.com/watch?v=zV3Ul2pA2Fw10    https://en.wikipedia.org/wiki/Disjoint-set_data_structure11    https://atcoder.jp/contests/abc120/submissions/444494212    '''13 14    def __init__(self, number_count: int):15        '''16        Args:17            number_count: The size of elements (greater than 2).18        '''19        self.parent_numbers = [-1 for _ in range(number_count)]20 21    def find_root(self, number: int) -> int:22        '''Follows the chain of parent pointers from number up the tree until23           it reaches a root element, whose parent is itself.24        Args:25            number: The trees id (0-index).26        Returns:27            The index of a root element.28        '''29        if self.parent_numbers[number] < 0:30            return number31 32        self.parent_numbers[number] = self.find_root(self.parent_numbers[number])33        return self.parent_numbers[number]34 35    def get_group_size(self, number: int) -> int:36        '''37        Args:38            number: The trees id (0-index).39        Returns:40            The size of group.41        '''42        return -self.parent_numbers[self.find_root(number)]43 44    def is_same_group(self, number_x: int, number_y: int) -> bool:45        '''Represents the roots of tree number_x and number_y are in the same46           group.47        Args:48            number_x: The trees x (0-index).49            number_y: The trees y (0-index).50        '''51        return self.find_root(number_x) == self.find_root(number_y)52 53    def merge_if_needs(self, number_x: int, number_y: int) -> bool:54        '''Uses find_root to determine the roots of the tree number_x and55           number_y belong to. If the roots are distinct, the trees are combined56           by attaching the roots of one to the root of the other.57        Args:58            number_x: The trees x (0-index).59            number_y: The trees y (0-index).60        '''61        x = self.find_root(number_x)62        y = self.find_root(number_y)63 64        if x == y:65            return False66 67        if self.get_group_size(x) >= self.get_group_size(y):68            self.parent_numbers[x] += self.parent_numbers[y]69            self.parent_numbers[y] = x70        else:71            self.parent_numbers[y] += self.parent_numbers[x]72            self.parent_numbers[x] = y73        return True74 75 76def main():77    import sys78 79    input = sys.stdin.readline80 81    n, m = map(int, input().split())82    a = sorted(list(map(int, input().split())))83    uf = UnionFind(n)84 85    # 解説放送: 86    # 連続した数字が並ぶように、グループ分け87    # Union Findを使うと、境界の処理が楽になる88    for i in range(n):89        j = (i + 1) % n90 91        if (a[i] == a[j]) or (((a[i] + 1) % m) == a[j]):92            uf.merge_if_needs(i, j)93    94    # 各グループの合計95    summed = [0] * n96    97    for i, ai in enumerate(a):98        summed[uf.find_root(i)] += ai99    100    ans = sum(a) - max(summed)101    print(ans) 102 103 104if __name__ == "__main__":105    main()106