結果

問題 No.2382 Amidakuji M
ユーザー nikoro256nikoro256
提出日時 2023-07-14 23:14:43
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 495 ms / 2,000 ms
コード長 4,654 bytes
コンパイル時間 2,264 ms
コンパイル使用メモリ 86,768 KB
実行使用メモリ 113,556 KB
最終ジャッジ日時 2023-10-14 13:43:18
合計ジャッジ時間 9,439 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 161 ms
80,500 KB
testcase_01 AC 158 ms
80,460 KB
testcase_02 AC 163 ms
80,580 KB
testcase_03 AC 365 ms
96,660 KB
testcase_04 AC 413 ms
106,992 KB
testcase_05 AC 239 ms
85,768 KB
testcase_06 AC 322 ms
97,364 KB
testcase_07 AC 293 ms
92,344 KB
testcase_08 AC 216 ms
83,252 KB
testcase_09 AC 379 ms
101,208 KB
testcase_10 AC 465 ms
110,220 KB
testcase_11 AC 285 ms
93,964 KB
testcase_12 AC 390 ms
103,492 KB
testcase_13 AC 163 ms
80,444 KB
testcase_14 AC 159 ms
80,292 KB
testcase_15 AC 160 ms
80,584 KB
testcase_16 AC 164 ms
80,420 KB
testcase_17 AC 160 ms
80,192 KB
testcase_18 AC 158 ms
80,200 KB
testcase_19 AC 495 ms
113,516 KB
testcase_20 AC 474 ms
113,464 KB
testcase_21 AC 490 ms
113,556 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, Optional, 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) -> 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, 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 math
st=SortedSet()
N,M=map(int,input().split())
P=list(map(int,input().split()))
count=0
for i in range(N):
    st.add(P[i])
    count+=len(st)-st.index_right(P[i])
if count%2==1 and M%2==0:
    print(-1)
elif count%2==0 and M%2==0:
    print((((count-1)//M+1)*M))
elif count%2==0 and M%2==1:
    M=2*M
    print((((count-1)//M+1)*M))
elif count%2==1 and M%2==1:
    ans=((((count-1)//M+1)*M))
    if ans%2==0:
        ans+=M
    print(ans)
0