結果
問題 | No.1300 Sum of Inversions |
ユーザー |
![]() |
提出日時 | 2022-06-02 23:42:07 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,516 bytes |
コンパイル時間 | 214 ms |
コンパイル使用メモリ | 82,568 KB |
実行使用メモリ | 165,192 KB |
最終ジャッジ日時 | 2024-09-21 02:11:58 |
合計ジャッジ時間 | 52,736 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 TLE * 3 |
ソースコード
import sysimport pypyjitimport itertoolsimport heapqimport mathfrom collections import deque, defaultdictimport bisectinput = sys.stdin.readlinesys.setrecursionlimit(10 ** 6)pypyjit.set_param('max_unroll_recursion=-1')def index_lt(a, x):'return largest index s.t. A[i] < x or -1 if it does not exist'return bisect.bisect_left(a, x) - 1def index_le(a, x):'return largest index s.t. A[i] <= x or -1 if it does not exist'return bisect.bisect_right(a, x) - 1def index_gt(a, x):'return smallest index s.t. A[i] > x or len(a) if it does not exist'return bisect.bisect_right(a, x)def index_ge(a, x):'return smallest index s.t. A[i] >= x or len(a) if it does not exist'return bisect.bisect_left(a, x)class SegTree:def __init__(self, N, func, e):self.N = Nself.func = funcself.X = [e] * (N << 1)self.e = edef build(self, seq):for i in range(self.N):self.X[self.N + i] = seq[i]for i in range(self.N)[::-1]:self.X[i] = self.func(self.X[i << 1], self.X[i << 1 | 1])def add(self, i, x):i += self.Nself.X[i] += xwhile i > 1:i >>= 1self.X[i] = self.func(self.X[i << 1], self.X[i << 1 | 1])def update(self, i, x):i += self.Nself.X[i] = xwhile i > 1:i >>= 1self.X[i] = self.func(self.X[i << 1], self.X[i << 1 | 1])def query(self, L, R):L += self.NR += self.NvL = self.evR = self.ewhile L < R:if L & 1:vL = self.func(vL, self.X[L])L += 1if R & 1:R -= 1vR = self.func(self.X[R], vR)L >>= 1R >>= 1return self.func(vL, vR)N = int(input())A = list(map(int, input().split()))mod = 998_244_353D = defaultdict(list)for i, a in enumerate(A):D[a].append(i)S = [0] * (N + 1)S[0] = A[0]for i in range(1, N):S[i] = S[i - 1] + A[i]def f(a, b):return ((a[0] + b[0], a[1] + b[1]))st = SegTree(N, f, (0, 0))ans = 0for k in sorted(D.keys()):for j, i in enumerate(D[k]):r, sr = st.query(i, N)_l, _sl = st.query(0, i)l, sl = i - _l, S[i] - _sll -= jsl -= k * (j + 1)ans += sl * rans += sr * lans += k * r * lans %= modfor i in D[k]:st.update(i, (1, k))print(ans)