#975547 (PyPy3) No.2740 Old Maid

提出ソース

結果

問題	No.2740 Old Maid
ユーザー	PNJ
提出日時	2024-04-20 16:41:35
言語	PyPy3 (7.3.15)
結果	AC
実行時間	694 ms / 2,000 ms
コード長	5,067 bytes
コンパイル時間	179 ms
コンパイル使用メモリ	82,564 KB
実行使用メモリ	155,544 KB
最終ジャッジ日時	2024-10-12 12:30:39
合計ジャッジ時間	23,474 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	484 ms 155,328 KB
testcase_01	AC	477 ms 155,368 KB
testcase_02	AC	477 ms 155,220 KB
testcase_03	AC	513 ms 155,544 KB
testcase_04	AC	508 ms 155,208 KB
testcase_05	AC	500 ms 155,216 KB
testcase_06	AC	502 ms 155,264 KB
testcase_07	AC	508 ms 155,080 KB
testcase_08	AC	497 ms 155,240 KB
testcase_09	AC	488 ms 155,480 KB
testcase_10	AC	452 ms 155,480 KB
testcase_11	AC	512 ms 155,212 KB
testcase_12	AC	523 ms 126,632 KB
testcase_13	AC	567 ms 133,568 KB
testcase_14	AC	253 ms 86,128 KB
testcase_15	AC	279 ms 88,524 KB
testcase_16	AC	437 ms 113,260 KB
testcase_17	AC	248 ms 85,148 KB
testcase_18	AC	512 ms 127,788 KB
testcase_19	AC	301 ms 91,624 KB
testcase_20	AC	615 ms 141,992 KB
testcase_21	AC	253 ms 86,400 KB
testcase_22	AC	457 ms 112,216 KB
testcase_23	AC	209 ms 83,448 KB
testcase_24	AC	297 ms 91,788 KB
testcase_25	AC	642 ms 145,840 KB
testcase_26	AC	132 ms 79,104 KB
testcase_27	AC	174 ms 81,408 KB
testcase_28	AC	451 ms 113,148 KB
testcase_29	AC	438 ms 109,460 KB
testcase_30	AC	185 ms 81,964 KB
testcase_31	AC	694 ms 154,480 KB
testcase_32	AC	289 ms 93,764 KB
testcase_33	AC	651 ms 146,696 KB
testcase_34	AC	433 ms 109,372 KB
testcase_35	AC	311 ms 90,664 KB
testcase_36	AC	283 ms 91,692 KB
testcase_37	AC	369 ms 105,648 KB
testcase_38	AC	286 ms 90,808 KB
testcase_39	AC	234 ms 84,828 KB
testcase_40	AC	484 ms 119,872 KB
testcase_41	AC	592 ms 141,796 KB
testcase_42	AC	64 ms 68,536 KB
testcase_43	AC	65 ms 69,764 KB
testcase_44	AC	64 ms 68,124 KB
testcase_45	AC	64 ms 69,052 KB
testcase_46	AC	65 ms 68,724 KB
testcase_47	AC	65 ms 69,332 KB
testcase_48	AC	64 ms 67,976 KB
testcase_49	AC	64 ms 68,644 KB
testcase_50	AC	65 ms 68,932 KB
testcase_51	AC	64 ms 69,828 KB
testcase_52	AC	65 ms 68,572 KB
testcase_53	AC	65 ms 68,676 KB
testcase_54	AC	65 ms 69,232 KB
testcase_55	AC	64 ms 68,792 KB
testcase_56	AC	64 ms 67,772 KB
testcase_57	AC	63 ms 68,052 KB
testcase_58	AC	65 ms 68,240 KB
testcase_59	AC	65 ms 69,616 KB
testcase_60	AC	64 ms 68,620 KB
testcase_61	AC	63 ms 68,316 KB
testcase_62	AC	63 ms 68,052 KB
testcase_63	AC	64 ms 67,988 KB
testcase_64	AC	64 ms 68,332 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 16
    SPLIT_RATIO = 24
    
    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        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) -> 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 "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
    
    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

N = int(input())
P = list(map(int,input().split()))
d = {}
for i in range(N):
  d[P[i]] = i
S = SortedMultiset([i for i in range(N)])
SS = SortedMultiset([i + 1 for i in range(N)])
ans = []
while N:
  n = SS[0]
  if d[n] == S[-1]:
    n = SS[1]
  j = d[n]
  k = S.gt(j)
  S.discard(j)
  S.discard(k)
  ans.append(P[j])
  ans.append(P[k])
  SS.discard(P[j])
  SS.discard(P[k])
  N -= 2
print(*ans)

yukicoder

結果

テストケース

ソースコード