結果
問題 | No.1300 Sum of Inversions |
ユーザー | terasa |
提出日時 | 2022-08-16 19:32:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,689 ms / 2,000 ms |
コード長 | 1,912 bytes |
コンパイル時間 | 262 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 135,364 KB |
最終ジャッジ日時 | 2024-04-14 13:28:18 |
合計ジャッジ時間 | 41,901 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
65,184 KB |
testcase_01 | AC | 57 ms
65,032 KB |
testcase_02 | AC | 58 ms
65,468 KB |
testcase_03 | AC | 1,308 ms
123,452 KB |
testcase_04 | AC | 1,263 ms
122,544 KB |
testcase_05 | AC | 1,020 ms
115,884 KB |
testcase_06 | AC | 1,446 ms
129,892 KB |
testcase_07 | AC | 1,392 ms
125,812 KB |
testcase_08 | AC | 1,519 ms
132,748 KB |
testcase_09 | AC | 1,543 ms
131,320 KB |
testcase_10 | AC | 838 ms
106,944 KB |
testcase_11 | AC | 864 ms
107,476 KB |
testcase_12 | AC | 1,265 ms
122,916 KB |
testcase_13 | AC | 1,231 ms
121,924 KB |
testcase_14 | AC | 1,689 ms
135,364 KB |
testcase_15 | AC | 1,516 ms
130,780 KB |
testcase_16 | AC | 1,321 ms
123,704 KB |
testcase_17 | AC | 816 ms
105,556 KB |
testcase_18 | AC | 954 ms
110,812 KB |
testcase_19 | AC | 1,110 ms
115,964 KB |
testcase_20 | AC | 1,152 ms
117,616 KB |
testcase_21 | AC | 1,133 ms
119,508 KB |
testcase_22 | AC | 1,004 ms
114,776 KB |
testcase_23 | AC | 1,426 ms
130,204 KB |
testcase_24 | AC | 1,047 ms
116,024 KB |
testcase_25 | AC | 913 ms
109,364 KB |
testcase_26 | AC | 889 ms
109,268 KB |
testcase_27 | AC | 997 ms
113,852 KB |
testcase_28 | AC | 1,553 ms
133,692 KB |
testcase_29 | AC | 1,083 ms
118,972 KB |
testcase_30 | AC | 1,494 ms
131,632 KB |
testcase_31 | AC | 1,020 ms
116,624 KB |
testcase_32 | AC | 1,091 ms
118,208 KB |
testcase_33 | AC | 643 ms
128,740 KB |
testcase_34 | AC | 651 ms
134,068 KB |
testcase_35 | AC | 645 ms
129,844 KB |
testcase_36 | AC | 656 ms
133,752 KB |
ソースコード
import sys import pypyjit import itertools import heapq import math from collections import deque, defaultdict import bisect import string input = sys.stdin.readline sys.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) - 1 def 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) - 1 def 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 BIT: # 0-indexed def __init__(self, N): self.N = N self.X = [0] * (N + 1) def add(self, i, x): i += 1 while i <= self.N: self.X[i] += x self.X[i] %= mod i += i & -i def sum(self, i): s = 0 while i > 0: s += self.X[i] s %= mod i -= i & -i return s def range_sum(self, l, r): return self.sum(r) - self.sum(l) N = int(input()) A = list(map(int, input().split())) mod = 998244353 brn = BIT(N) brs = BIT(N) bln = BIT(N) bls = BIT(N) R = [0] * N Sr = [0] * N L = [0] * N Sl = [0] * N B = [(i, A[i]) for i in range(N)] B.sort(key=lambda x: x[1]) for i, a in B: brn.add(i, 1) brs.add(i, a) R[i] = brn.range_sum(i + 1, N) Sr[i] = brs.range_sum(i + 1, N) B.sort(key=lambda x: x[0], reverse=True) B.sort(key=lambda x: x[1], reverse=True) for i, a in B: bln.add(i, 1) bls.add(i, a) L[i] = bln.range_sum(0, i) Sl[i] = bls.range_sum(0, i) ans = 0 for i in range(N): ans += R[i] * Sl[i] + L[i] * Sr[i] + A[i] * R[i] * L[i] ans %= mod print(ans)