結果

問題 No.2740 Old Maid
ユーザー ThetaTheta
提出日時 2024-04-23 18:21:33
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,285 bytes
コンパイル時間 163 ms
コンパイル使用メモリ 82,096 KB
実行使用メモリ 219,796 KB
最終ジャッジ日時 2024-04-23 18:22:40
合計ジャッジ時間 52,769 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,819 ms
219,020 KB
testcase_01 AC 1,767 ms
219,248 KB
testcase_02 AC 1,832 ms
218,844 KB
testcase_03 AC 1,817 ms
219,796 KB
testcase_04 AC 1,864 ms
219,032 KB
testcase_05 AC 1,803 ms
219,740 KB
testcase_06 AC 1,773 ms
219,392 KB
testcase_07 AC 1,805 ms
218,884 KB
testcase_08 AC 1,803 ms
218,368 KB
testcase_09 AC 1,777 ms
218,512 KB
testcase_10 AC 1,745 ms
218,888 KB
testcase_11 AC 1,230 ms
181,800 KB
testcase_12 AC 1,932 ms
169,076 KB
testcase_13 TLE -
testcase_14 AC 529 ms
96,312 KB
testcase_15 AC 701 ms
104,388 KB
testcase_16 AC 1,528 ms
144,764 KB
testcase_17 AC 515 ms
97,088 KB
testcase_18 TLE -
testcase_19 AC 877 ms
114,340 KB
testcase_20 TLE -
testcase_21 AC 575 ms
98,824 KB
testcase_22 AC 1,488 ms
144,588 KB
testcase_23 AC 433 ms
93,016 KB
testcase_24 AC 864 ms
111,252 KB
testcase_25 TLE -
testcase_26 AC 155 ms
80,896 KB
testcase_27 AC 357 ms
87,752 KB
testcase_28 AC 1,539 ms
146,064 KB
testcase_29 AC 1,463 ms
142,888 KB
testcase_30 AC 245 ms
83,684 KB
testcase_31 TLE -
testcase_32 AC 1,018 ms
116,484 KB
testcase_33 TLE -
testcase_34 AC 1,451 ms
142,312 KB
testcase_35 AC 841 ms
109,860 KB
testcase_36 AC 844 ms
112,604 KB
testcase_37 AC 1,179 ms
129,564 KB
testcase_38 AC 781 ms
107,588 KB
testcase_39 AC 492 ms
93,836 KB
testcase_40 AC 1,815 ms
163,072 KB
testcase_41 TLE -
testcase_42 AC 66 ms
69,336 KB
testcase_43 AC 69 ms
69,000 KB
testcase_44 AC 68 ms
69,452 KB
testcase_45 AC 67 ms
69,964 KB
testcase_46 AC 68 ms
68,456 KB
testcase_47 AC 66 ms
67,868 KB
testcase_48 AC 67 ms
67,924 KB
testcase_49 AC 68 ms
70,516 KB
testcase_50 AC 97 ms
69,988 KB
testcase_51 AC 67 ms
70,188 KB
testcase_52 AC 68 ms
68,816 KB
testcase_53 AC 68 ms
68,436 KB
testcase_54 AC 67 ms
68,800 KB
testcase_55 AC 68 ms
68,336 KB
testcase_56 AC 66 ms
67,608 KB
testcase_57 AC 66 ms
68,732 KB
testcase_58 AC 70 ms
69,636 KB
testcase_59 AC 70 ms
70,088 KB
testcase_60 AC 66 ms
68,784 KB
testcase_61 AC 67 ms
69,100 KB
testcase_62 AC 67 ms
67,660 KB
testcase_63 AC 67 ms
68,956 KB
testcase_64 AC 66 ms
68,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from heapq import heappush, heapify, heappop
from itertools import pairwise
import sys
from bisect import bisect_left, bisect_right
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from collections import defaultdict
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional, Hashable


T = TypeVar('T')


def printe(*args, end="\n", **kwargs):
    print(*args, end=end, file=sys.stderr, **kwargs)


T_ = TypeVar('T_', bound=Hashable)


class RemovableHeapQueue:
    def __init__(self, seq: list[T_] = None) -> None:
        self.__queue: list[T_] = []
        if seq is not None:
            self.__queue.extend(seq)
            heapify(self.__queue)
        self.__remove_queue: dict[T_, int] = defaultdict(int)
        self.__length = len(self.__queue)

    def pop(self) -> T_:
        while self.__queue:
            value = heappop(self.__queue)
            if self.__remove_queue[value] > 0:
                self.__remove_queue[value] -= 1
                continue
            self.__length -= 1
            return value
        raise IndexError

    def push(self, item: T_) -> None:
        self.__length += 1
        if self.__remove_queue[item] > 0:
            self.__remove_queue[item] -= 1
            return
        heappush(self.__queue, item)

    @property
    def top(self) -> T_:
        while self.__queue:
            value = self.__queue[0]
            if self.__remove_queue[value] > 0:

                heappop(self.__queue)
                self.__remove_queue[value] -= 1
                continue
            return value
        raise IndexError

    def remove(self, item: T_) -> None:
        self.__remove_queue[item] += 1
        self.__length -= 1

    def __len__(self) -> int:
        return self.__length


def main():
    N = int(input())
    p = list(map(int, input().split()))
    next_idxs = list(range(1, N + 1))
    next_idxs[-1] = -1
    prev_idxs = list(range(-1, N - 1))

    pairs_set = RemovableHeapQueue()
    for idx, (pair_1, pair_2) in enumerate(pairwise(p)):
        pairs_set.push((pair_1, pair_2, idx, idx + 1))

    q = []
    while pairs_set:
        used = pairs_set.pop()
        q.extend(used[:2])
        idx_1 = used[2]
        idx_2 = used[3]
        if prev_idxs[idx_1] != -1:
            pairs_set.remove(
                (p[prev_idxs[idx_1]], p[idx_1], prev_idxs[idx_1], idx_1))
        if next_idxs[idx_2] != -1:
            pairs_set.remove(
                (p[idx_2], p[next_idxs[idx_2]], idx_2, next_idxs[idx_2]))

        if prev_idxs[idx_1] != -1 and next_idxs[idx_2] != -1:
            pairs_set.push((p[prev_idxs[idx_1]],
                           p[next_idxs[idx_2]],
                           prev_idxs[idx_1],
                           next_idxs[idx_2]))

        # 前後関係を更新する
        if prev_idxs[idx_1] != -1:
            if next_idxs[idx_2] != -1:
                next_idxs[prev_idxs[idx_1]] = next_idxs[idx_2]
            else:
                next_idxs[prev_idxs[idx_1]] = -1
        if next_idxs[idx_2] != -1:
            if prev_idxs[idx_1] != -1:
                prev_idxs[next_idxs[idx_2]] = prev_idxs[idx_1]
            else:
                prev_idxs[next_idxs[idx_2]] = -1
    print(*q)


if __name__ == "__main__":
    main()
0