結果

問題 No.1425 Yet Another Cyclic Shifts Sorting
ユーザー rlangevinrlangevin
提出日時 2023-10-04 22:00:44
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,963 bytes
コンパイル時間 435 ms
コンパイル使用メモリ 87,160 KB
実行使用メモリ 171,084 KB
最終ジャッジ日時 2023-10-04 22:01:07
合計ジャッジ時間 21,485 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 159 ms
78,124 KB
testcase_01 AC 163 ms
78,220 KB
testcase_02 AC 160 ms
78,120 KB
testcase_03 AC 175 ms
77,836 KB
testcase_04 AC 159 ms
78,096 KB
testcase_05 AC 160 ms
78,100 KB
testcase_06 WA -
testcase_07 AC 163 ms
78,152 KB
testcase_08 WA -
testcase_09 AC 161 ms
77,832 KB
testcase_10 AC 174 ms
78,200 KB
testcase_11 WA -
testcase_12 AC 162 ms
78,120 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 162 ms
78,144 KB
testcase_17 AC 176 ms
77,812 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 576 ms
137,100 KB
testcase_23 AC 269 ms
96,556 KB
testcase_24 AC 251 ms
93,764 KB
testcase_25 AC 573 ms
139,244 KB
testcase_26 AC 671 ms
171,084 KB
testcase_27 AC 662 ms
143,080 KB
testcase_28 AC 713 ms
169,500 KB
testcase_29 AC 343 ms
107,448 KB
testcase_30 AC 328 ms
98,340 KB
testcase_31 AC 713 ms
169,420 KB
testcase_32 AC 366 ms
105,008 KB
testcase_33 AC 222 ms
83,076 KB
testcase_34 AC 356 ms
111,056 KB
testcase_35 AC 702 ms
157,976 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import *
# 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

################################

N = int(input())
A = list(map(int, input().split()))
A.reverse()
D = defaultdict(list)
for i in range(N):
    D[A[i]].append(i)

for k, v in D.items():
    D[k].reverse()

L = []
A.sort()
for i in range(N - 1, -1, -1):
    L.append(D[A[i]].pop())

H = SortedSet()
for i in range(N):
    H.add(i)

ans = 0
pre = 0
flag = 0
for i in range(N):
    ind = H.index(L[i])
    if ind != pre and (ind != 0 or flag):
        ans += 1
    pre = ind
    if ind != N - i - 1:
        flag = 1
    else:
        flag = 0
    H.discard(L[i])

print(ans)
0