結果

問題 No.2616 中央番目の中央値
ユーザー nikoro256nikoro256
提出日時 2024-01-26 23:38:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,824 ms / 2,000 ms
コード長 5,624 bytes
コンパイル時間 623 ms
コンパイル使用メモリ 81,828 KB
実行使用メモリ 261,512 KB
最終ジャッジ日時 2024-01-26 23:38:55
合計ジャッジ時間 35,525 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 160 ms
160,688 KB
testcase_01 AC 157 ms
160,688 KB
testcase_02 AC 154 ms
160,688 KB
testcase_03 AC 155 ms
160,688 KB
testcase_04 AC 164 ms
160,688 KB
testcase_05 AC 153 ms
160,688 KB
testcase_06 AC 158 ms
160,688 KB
testcase_07 AC 155 ms
160,688 KB
testcase_08 AC 156 ms
160,944 KB
testcase_09 AC 173 ms
165,296 KB
testcase_10 AC 178 ms
165,296 KB
testcase_11 AC 185 ms
165,296 KB
testcase_12 AC 198 ms
165,296 KB
testcase_13 AC 269 ms
165,552 KB
testcase_14 AC 302 ms
165,680 KB
testcase_15 AC 359 ms
165,808 KB
testcase_16 AC 402 ms
165,424 KB
testcase_17 AC 448 ms
165,680 KB
testcase_18 AC 496 ms
165,936 KB
testcase_19 AC 685 ms
165,552 KB
testcase_20 AC 706 ms
165,552 KB
testcase_21 AC 1,179 ms
165,552 KB
testcase_22 AC 1,789 ms
165,552 KB
testcase_23 AC 1,754 ms
165,552 KB
testcase_24 AC 1,393 ms
260,744 KB
testcase_25 AC 1,824 ms
261,512 KB
testcase_26 AC 1,779 ms
165,552 KB
testcase_27 AC 1,794 ms
165,552 KB
testcase_28 AC 1,777 ms
165,552 KB
testcase_29 AC 1,736 ms
165,552 KB
testcase_30 AC 1,736 ms
165,552 KB
testcase_31 AC 1,753 ms
165,552 KB
testcase_32 AC 1,745 ms
165,552 KB
testcase_33 AC 1,740 ms
165,552 KB
testcase_34 AC 1,701 ms
165,552 KB
testcase_35 AC 1,718 ms
165,552 KB
testcase_36 AC 1,732 ms
165,552 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 = 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

def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p=998244353
N = 4*10**5  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用S
 
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

N=int(input())
P=list(map(int,input().split()))
st=SortedSet()
st2=SortedSet()
for i in range(N):
    st2.add(P[i])
ans=0
p=998244353
for i in range(N):
    lt=st.index(P[i])
    gt=i-lt
    lt2=st2.index(P[i])
    gt2=N-1-i-lt2
    ans+=cmb(lt+gt2,min(lt,gt2),p)*cmb(lt2+gt,min(gt,lt2),p)
    ans%=p
    st.add(P[i])
    st2.discard(P[i])
print(ans)
0