結果

問題 No.2250 Split Permutation
ユーザー mkawa2mkawa2
提出日時 2023-03-17 22:59:23
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 318 ms / 3,000 ms
コード長 2,014 bytes
コンパイル時間 160 ms
コンパイル使用メモリ 82,684 KB
実行使用メモリ 110,144 KB
最終ジャッジ日時 2024-09-18 12:06:41
合計ジャッジ時間 5,984 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353
class BitSum:
def __init__(self, n):
self._n = n+1
self._table = [0]*self._n
self._origin = [0]*n
def __getitem__(self, item):
return self._origin[item]
def add(self, i, x):
self._origin[i] += x
i += 1
while i < self._n:
self._table[i] += x
i += i & -i
def sum(self, i):
i += 1
res = 0
while i > 0:
res += self._table[i]
i -= i & -i
return res
def sumlr(self, l, r):
if l >= r: return 0
if l == 0: return self.sum(r-1)
return self.sum(r-1)-self.sum(l-1)
# return "min(i) of sum(i)>=x" or "N"
def bisect(self, x):
idx = 0
d = 1 << (self._n-1).bit_length()-1
while d:
if idx+d < self._n and self._table[idx+d] < x:
x -= self._table[idx+d]
idx |= d
d >>= 1
return idx
n = II()
aa = LI1()
pw = [1]*n
for i in range(n-1): pw[i+1] = pw[i]*2%md
ans = 0
bit = BitSum(n)
for i in range(n)[::-1]:
a = aa[i]
ans += bit.sum(a)*pw[n-1]%md
ans %= md
bit.add(a, 1)
bit = BitSum(n)
for i in range(n)[::-1]:
a = aa[i]
ans -= bit.sum(a)*pw[i]%md
ans %= md
bit.add(a, pw[n-1-i])
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0