結果

問題 No.2740 Old Maid
ユーザー miya145592miya145592
提出日時 2024-04-20 18:44:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 938 ms / 2,000 ms
コード長 4,662 bytes
コンパイル時間 319 ms
コンパイル使用メモリ 82,444 KB
実行使用メモリ 174,140 KB
最終ジャッジ日時 2024-04-20 18:45:20
合計ジャッジ時間 31,321 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 844 ms
162,100 KB
testcase_01 AC 751 ms
161,872 KB
testcase_02 AC 725 ms
160,968 KB
testcase_03 AC 777 ms
164,232 KB
testcase_04 AC 767 ms
167,376 KB
testcase_05 AC 724 ms
164,820 KB
testcase_06 AC 732 ms
166,588 KB
testcase_07 AC 729 ms
165,972 KB
testcase_08 AC 717 ms
165,196 KB
testcase_09 AC 741 ms
160,844 KB
testcase_10 AC 696 ms
163,724 KB
testcase_11 AC 692 ms
174,140 KB
testcase_12 AC 725 ms
115,276 KB
testcase_13 AC 779 ms
117,576 KB
testcase_14 AC 309 ms
86,272 KB
testcase_15 AC 455 ms
89,932 KB
testcase_16 AC 624 ms
107,552 KB
testcase_17 AC 377 ms
87,244 KB
testcase_18 AC 723 ms
116,412 KB
testcase_19 AC 473 ms
94,048 KB
testcase_20 AC 829 ms
122,860 KB
testcase_21 AC 343 ms
87,216 KB
testcase_22 AC 565 ms
107,424 KB
testcase_23 AC 365 ms
87,004 KB
testcase_24 AC 428 ms
91,012 KB
testcase_25 AC 898 ms
124,504 KB
testcase_26 AC 133 ms
80,080 KB
testcase_27 AC 251 ms
82,152 KB
testcase_28 AC 642 ms
107,576 KB
testcase_29 AC 596 ms
104,568 KB
testcase_30 AC 197 ms
81,756 KB
testcase_31 AC 938 ms
131,596 KB
testcase_32 AC 410 ms
94,196 KB
testcase_33 AC 914 ms
125,692 KB
testcase_34 AC 631 ms
104,792 KB
testcase_35 AC 447 ms
90,252 KB
testcase_36 AC 423 ms
92,368 KB
testcase_37 AC 558 ms
100,324 KB
testcase_38 AC 371 ms
90,480 KB
testcase_39 AC 365 ms
87,240 KB
testcase_40 AC 705 ms
109,792 KB
testcase_41 AC 762 ms
123,016 KB
testcase_42 AC 65 ms
69,716 KB
testcase_43 AC 61 ms
68,796 KB
testcase_44 AC 59 ms
69,376 KB
testcase_45 AC 60 ms
68,512 KB
testcase_46 AC 60 ms
69,256 KB
testcase_47 AC 58 ms
69,364 KB
testcase_48 AC 58 ms
68,624 KB
testcase_49 AC 62 ms
68,192 KB
testcase_50 AC 58 ms
69,140 KB
testcase_51 AC 61 ms
69,968 KB
testcase_52 AC 62 ms
69,912 KB
testcase_53 AC 62 ms
69,504 KB
testcase_54 AC 59 ms
68,388 KB
testcase_55 AC 60 ms
68,612 KB
testcase_56 AC 58 ms
68,644 KB
testcase_57 AC 58 ms
68,612 KB
testcase_58 AC 59 ms
68,580 KB
testcase_59 AC 69 ms
69,176 KB
testcase_60 AC 60 ms
69,088 KB
testcase_61 AC 57 ms
67,876 KB
testcase_62 AC 60 ms
69,708 KB
testcase_63 AC 63 ms
68,324 KB
testcase_64 AC 55 ms
68,840 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