結果

問題 No.2740 Old Maid
ユーザー tkykwtnbtkykwtnb
提出日時 2024-04-20 19:23:38
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,176 ms / 2,000 ms
コード長 5,331 bytes
コンパイル時間 135 ms
コンパイル使用メモリ 82,232 KB
実行使用メモリ 225,532 KB
最終ジャッジ日時 2024-04-20 19:24:26
合計ジャッジ時間 36,522 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,062 ms
206,732 KB
testcase_01 AC 949 ms
201,464 KB
testcase_02 AC 1,082 ms
211,824 KB
testcase_03 AC 1,112 ms
209,808 KB
testcase_04 AC 1,091 ms
205,820 KB
testcase_05 AC 1,091 ms
201,972 KB
testcase_06 AC 957 ms
203,204 KB
testcase_07 AC 1,071 ms
204,732 KB
testcase_08 AC 1,089 ms
213,392 KB
testcase_09 AC 1,073 ms
206,292 KB
testcase_10 AC 1,042 ms
205,656 KB
testcase_11 AC 1,086 ms
225,532 KB
testcase_12 AC 847 ms
133,508 KB
testcase_13 AC 926 ms
139,460 KB
testcase_14 AC 361 ms
88,092 KB
testcase_15 AC 389 ms
90,444 KB
testcase_16 AC 723 ms
115,372 KB
testcase_17 AC 324 ms
87,236 KB
testcase_18 AC 798 ms
131,996 KB
testcase_19 AC 441 ms
94,256 KB
testcase_20 AC 1,014 ms
149,376 KB
testcase_21 AC 314 ms
86,540 KB
testcase_22 AC 707 ms
113,716 KB
testcase_23 AC 356 ms
84,716 KB
testcase_24 AC 449 ms
92,936 KB
testcase_25 AC 1,069 ms
148,952 KB
testcase_26 AC 167 ms
80,576 KB
testcase_27 AC 236 ms
82,152 KB
testcase_28 AC 666 ms
114,580 KB
testcase_29 AC 686 ms
112,960 KB
testcase_30 AC 194 ms
81,080 KB
testcase_31 AC 1,176 ms
158,496 KB
testcase_32 AC 422 ms
96,184 KB
testcase_33 AC 1,109 ms
144,932 KB
testcase_34 AC 659 ms
111,948 KB
testcase_35 AC 418 ms
94,064 KB
testcase_36 AC 367 ms
92,272 KB
testcase_37 AC 554 ms
105,324 KB
testcase_38 AC 385 ms
92,388 KB
testcase_39 AC 327 ms
86,828 KB
testcase_40 AC 812 ms
127,536 KB
testcase_41 AC 1,036 ms
147,008 KB
testcase_42 AC 59 ms
67,584 KB
testcase_43 AC 60 ms
69,120 KB
testcase_44 AC 57 ms
68,096 KB
testcase_45 AC 61 ms
68,352 KB
testcase_46 AC 59 ms
68,736 KB
testcase_47 AC 60 ms
67,940 KB
testcase_48 AC 62 ms
67,712 KB
testcase_49 AC 60 ms
68,128 KB
testcase_50 AC 60 ms
68,224 KB
testcase_51 AC 59 ms
68,224 KB
testcase_52 AC 59 ms
68,224 KB
testcase_53 AC 70 ms
68,352 KB
testcase_54 AC 59 ms
68,224 KB
testcase_55 AC 60 ms
68,260 KB
testcase_56 AC 60 ms
67,968 KB
testcase_57 AC 57 ms
68,352 KB
testcase_58 AC 61 ms
68,608 KB
testcase_59 AC 60 ms
68,992 KB
testcase_60 AC 59 ms
67,712 KB
testcase_61 AC 57 ms
67,584 KB
testcase_62 AC 58 ms
68,096 KB
testcase_63 AC 58 ms
67,712 KB
testcase_64 AC 58 ms
67,968 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170
    def _build(self, a: Optional[List[T]] = None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(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)
        self.size = len(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 __eq__(self, other) -> bool:
        return list(self) == list(other)
    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 _position(self, x: T) -> Tuple[List[T], int]:
        "Find the bucket and position which x should be inserted. self must not be empty."
        for a in self.a:
            if x <= a[-1]: break
        return (a, 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 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, i = self._position(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 _pop(self, a: List[T], i: int) -> T:
        ans = a.pop(i)
        self.size -= 1
        if not a: self._build()
        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, i = self._position(x)
        if i == len(a) or a[i] != x: return False
        self._pop(a, 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 a in reversed(self.a):
                i += len(a)
                if i >= 0: return self._pop(a, i)
        else:
            for a in self.a:
                if i < len(a): return self._pop(a, 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()))
restP=SortedSet()
# P内の要素をインデックスとペアで昇順に並べ替えたもの
for i,p in enumerate(P):
    restP.add((p,i))
# Pの要素の残り状況を表し、有効な右隣インデックスをO(1)で知るためのSortedSet
restPidx=SortedSet([i for i in range(N)])
ans=[]
t=0
while len(restP):
    p,i=restP[t]
    if restPidx.index(i)<len(restPidx)-1:
        p,i=restP.pop(t)
        ans.append(p)
        r=restPidx[restPidx.index(i)+1]
        ans.append(P[r])
        restPidx.discard(i)
        restPidx.discard(r)
        restP.discard((P[r],r))
        t=0
    else:t+=1
print(*ans)
0