結果

問題 No.2740 Old Maid
ユーザー miya145592miya145592
提出日時 2024-04-20 18:44:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,025 ms / 2,000 ms
コード長 4,662 bytes
コンパイル時間 415 ms
コンパイル使用メモリ 82,044 KB
実行使用メモリ 172,968 KB
最終ジャッジ日時 2024-10-12 15:27:20
合計ジャッジ時間 34,054 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 812 ms
162,456 KB
testcase_01 AC 807 ms
162,000 KB
testcase_02 AC 821 ms
160,596 KB
testcase_03 AC 854 ms
164,052 KB
testcase_04 AC 853 ms
167,380 KB
testcase_05 AC 855 ms
164,472 KB
testcase_06 AC 812 ms
166,228 KB
testcase_07 AC 835 ms
165,972 KB
testcase_08 AC 813 ms
164,936 KB
testcase_09 AC 816 ms
160,720 KB
testcase_10 AC 772 ms
163,656 KB
testcase_11 AC 755 ms
172,968 KB
testcase_12 AC 791 ms
114,384 KB
testcase_13 AC 851 ms
117,384 KB
testcase_14 AC 352 ms
86,108 KB
testcase_15 AC 486 ms
89,932 KB
testcase_16 AC 698 ms
107,296 KB
testcase_17 AC 405 ms
87,372 KB
testcase_18 AC 798 ms
116,164 KB
testcase_19 AC 517 ms
93,912 KB
testcase_20 AC 941 ms
123,264 KB
testcase_21 AC 368 ms
86,960 KB
testcase_22 AC 621 ms
107,300 KB
testcase_23 AC 408 ms
86,748 KB
testcase_24 AC 450 ms
90,904 KB
testcase_25 AC 1,016 ms
123,908 KB
testcase_26 AC 162 ms
79,744 KB
testcase_27 AC 296 ms
81,896 KB
testcase_28 AC 728 ms
107,196 KB
testcase_29 AC 609 ms
104,184 KB
testcase_30 AC 232 ms
81,760 KB
testcase_31 AC 1,009 ms
131,420 KB
testcase_32 AC 486 ms
94,236 KB
testcase_33 AC 1,025 ms
125,492 KB
testcase_34 AC 686 ms
104,792 KB
testcase_35 AC 459 ms
90,388 KB
testcase_36 AC 476 ms
92,108 KB
testcase_37 AC 614 ms
100,124 KB
testcase_38 AC 426 ms
90,016 KB
testcase_39 AC 426 ms
87,112 KB
testcase_40 AC 700 ms
109,792 KB
testcase_41 AC 880 ms
122,776 KB
testcase_42 AC 73 ms
67,712 KB
testcase_43 AC 74 ms
68,224 KB
testcase_44 AC 72 ms
67,840 KB
testcase_45 AC 73 ms
68,096 KB
testcase_46 AC 72 ms
68,096 KB
testcase_47 AC 74 ms
67,584 KB
testcase_48 AC 71 ms
67,840 KB
testcase_49 AC 73 ms
68,096 KB
testcase_50 AC 74 ms
68,224 KB
testcase_51 AC 73 ms
68,096 KB
testcase_52 AC 74 ms
67,968 KB
testcase_53 AC 76 ms
68,224 KB
testcase_54 AC 77 ms
67,968 KB
testcase_55 AC 76 ms
68,096 KB
testcase_56 AC 75 ms
67,840 KB
testcase_57 AC 73 ms
67,712 KB
testcase_58 AC 75 ms
68,224 KB
testcase_59 AC 75 ms
68,096 KB
testcase_60 AC 74 ms
67,968 KB
testcase_61 AC 77 ms
67,712 KB
testcase_62 AC 74 ms
67,584 KB
testcase_63 AC 72 ms
67,968 KB
testcase_64 AC 73 ms
67,584 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# 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, 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 __repr__(self) -> str:
        return "SortedSet" + str(self.a)
    
    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 heapq
import sys
input = sys.stdin.readline
N = int(input())
P = list(map(int, input().split()))
Q = []
A = []
for i, p in enumerate(P[:-1]):
    A.append((p, i))
heapq.heapify(A)
S = SortedSet([i for i in range(N)])
while A:
    p, i = heapq.heappop(A)
    if S.__contains__(i):
        j = S.gt(i)
        if j is None:
            continue
        Q.append(P[i])
        Q.append(P[j])
        S.discard(i)
        S.discard(j)
print(*Q)
0