結果

問題 No.2740 Old Maid
ユーザー ButterflvButterflv
提出日時 2024-04-23 20:47:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 697 ms / 2,000 ms
コード長 5,351 bytes
コンパイル時間 409 ms
コンパイル使用メモリ 82,440 KB
実行使用メモリ 251,116 KB
最終ジャッジ日時 2024-11-06 03:07:12
合計ジャッジ時間 25,091 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 446 ms
251,116 KB
testcase_01 AC 443 ms
251,080 KB
testcase_02 AC 438 ms
251,096 KB
testcase_03 AC 468 ms
251,024 KB
testcase_04 AC 446 ms
250,932 KB
testcase_05 AC 457 ms
250,720 KB
testcase_06 AC 430 ms
250,928 KB
testcase_07 AC 439 ms
250,720 KB
testcase_08 AC 430 ms
250,860 KB
testcase_09 AC 445 ms
250,788 KB
testcase_10 AC 398 ms
251,020 KB
testcase_11 AC 409 ms
250,864 KB
testcase_12 AC 497 ms
191,532 KB
testcase_13 AC 547 ms
206,676 KB
testcase_14 AC 212 ms
98,956 KB
testcase_15 AC 246 ms
107,808 KB
testcase_16 AC 424 ms
164,660 KB
testcase_17 AC 207 ms
96,052 KB
testcase_18 AC 506 ms
193,376 KB
testcase_19 AC 273 ms
120,448 KB
testcase_20 AC 594 ms
223,328 KB
testcase_21 AC 221 ms
102,024 KB
testcase_22 AC 445 ms
163,584 KB
testcase_23 AC 182 ms
92,088 KB
testcase_24 AC 278 ms
120,128 KB
testcase_25 AC 648 ms
231,060 KB
testcase_26 AC 115 ms
79,156 KB
testcase_27 AC 159 ms
87,328 KB
testcase_28 AC 417 ms
164,876 KB
testcase_29 AC 409 ms
155,328 KB
testcase_30 AC 145 ms
80,412 KB
testcase_31 AC 691 ms
249,984 KB
testcase_32 AC 284 ms
125,576 KB
testcase_33 AC 697 ms
232,100 KB
testcase_34 AC 412 ms
154,960 KB
testcase_35 AC 280 ms
116,704 KB
testcase_36 AC 269 ms
120,436 KB
testcase_37 AC 350 ms
145,640 KB
testcase_38 AC 265 ms
114,456 KB
testcase_39 AC 203 ms
95,896 KB
testcase_40 AC 486 ms
178,720 KB
testcase_41 AC 625 ms
222,784 KB
testcase_42 AC 64 ms
68,684 KB
testcase_43 AC 66 ms
69,160 KB
testcase_44 AC 65 ms
68,708 KB
testcase_45 AC 64 ms
67,988 KB
testcase_46 AC 65 ms
68,364 KB
testcase_47 AC 64 ms
67,848 KB
testcase_48 AC 66 ms
68,704 KB
testcase_49 AC 64 ms
68,644 KB
testcase_50 AC 65 ms
69,776 KB
testcase_51 AC 64 ms
69,384 KB
testcase_52 AC 64 ms
68,200 KB
testcase_53 AC 65 ms
68,336 KB
testcase_54 AC 64 ms
67,848 KB
testcase_55 AC 65 ms
67,988 KB
testcase_56 AC 64 ms
68,144 KB
testcase_57 AC 64 ms
68,768 KB
testcase_58 AC 65 ms
68,184 KB
testcase_59 AC 67 ms
69,644 KB
testcase_60 AC 65 ms
69,596 KB
testcase_61 AC 65 ms
68,648 KB
testcase_62 AC 63 ms
67,976 KB
testcase_63 AC 64 ms
69,060 KB
testcase_64 AC 64 ms
68,532 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, List, Tuple, TypeVar, Optional
T = TypeVar('T')

class SortedSet(Generic[T]):
    BUCKET_RATIO = 16
    SPLIT_RATIO = 24
    
    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)
        n = len(a)
        if any(a[i] > a[i + 1] for i in range(n - 1)):
            a.sort()
        if any(a[i] >= a[i + 1] for i in range(n - 1)):
            a, b = [], a
            for x in b:
                if not a or a[-1] != x:
                    a.append(x)
        n = self.size = len(a)
        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 "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, 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 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, b, 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.SPLIT_RATIO:
            mid = len(a) >> 1
            self.a[b:b+1] = [a[:mid], a[mid:]]
        return True
    
    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=["head"]+list(map(int, input().split()))+["tail"]
prev=dict()
nex=dict()
for i in range(len(P)-1):
  prev[P[i+1]]=P[i]
  nex[P[i]]=P[i+1]
q=[]

set_=SortedSet([i for i in range(1, N+1)])

while len(set_)>0:
  MIN=set_[0]
  if nex[MIN]=="tail":
    MIN=set_[1]
  NEXT=nex[MIN]
  nex[prev[MIN]]=nex[NEXT]
  prev[nex[NEXT]]=prev[MIN]
  set_.discard(MIN); set_.discard(NEXT)
  q.append(MIN); q.append(NEXT)

print(*q)
0