結果
問題 | No.1300 Sum of Inversions |
ユーザー | 👑 tamato |
提出日時 | 2020-11-27 21:52:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 690 ms / 2,000 ms |
コード長 | 2,079 bytes |
コンパイル時間 | 405 ms |
コンパイル使用メモリ | 87,312 KB |
実行使用メモリ | 128,268 KB |
最終ジャッジ日時 | 2023-10-01 05:27:47 |
合計ジャッジ時間 | 20,128 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,656 KB |
testcase_01 | AC | 74 ms
71,840 KB |
testcase_02 | AC | 73 ms
71,852 KB |
testcase_03 | AC | 575 ms
100,316 KB |
testcase_04 | AC | 529 ms
100,484 KB |
testcase_05 | AC | 466 ms
98,440 KB |
testcase_06 | AC | 626 ms
121,164 KB |
testcase_07 | AC | 602 ms
109,712 KB |
testcase_08 | AC | 673 ms
122,284 KB |
testcase_09 | AC | 676 ms
122,092 KB |
testcase_10 | AC | 436 ms
103,548 KB |
testcase_11 | AC | 444 ms
103,492 KB |
testcase_12 | AC | 577 ms
100,364 KB |
testcase_13 | AC | 559 ms
100,164 KB |
testcase_14 | AC | 688 ms
127,168 KB |
testcase_15 | AC | 638 ms
121,464 KB |
testcase_16 | AC | 554 ms
100,672 KB |
testcase_17 | AC | 396 ms
100,984 KB |
testcase_18 | AC | 423 ms
99,132 KB |
testcase_19 | AC | 465 ms
98,080 KB |
testcase_20 | AC | 495 ms
97,688 KB |
testcase_21 | AC | 478 ms
97,680 KB |
testcase_22 | AC | 455 ms
98,512 KB |
testcase_23 | AC | 614 ms
121,224 KB |
testcase_24 | AC | 451 ms
97,616 KB |
testcase_25 | AC | 430 ms
100,532 KB |
testcase_26 | AC | 440 ms
100,880 KB |
testcase_27 | AC | 465 ms
99,624 KB |
testcase_28 | AC | 690 ms
125,484 KB |
testcase_29 | AC | 494 ms
98,076 KB |
testcase_30 | AC | 636 ms
122,224 KB |
testcase_31 | AC | 463 ms
98,472 KB |
testcase_32 | AC | 457 ms
97,292 KB |
testcase_33 | AC | 329 ms
112,816 KB |
testcase_34 | AC | 338 ms
128,268 KB |
testcase_35 | AC | 321 ms
106,248 KB |
testcase_36 | AC | 353 ms
126,084 KB |
ソースコード
mod = 998244353 eps = 10**-9 def main(): import sys input = sys.stdin.readline class Bit: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) def sum(self, i): s = 0 while i > 0: s += self.tree[i] i -= i & -i return s def add(self, i, x): while i <= self.size: self.tree[i] += x i += i & -i def lower_bound(self, w): if w <= 0: return 0 x = 0 k = 1 << (self.size.bit_length() - 1) while k: if x + k <= self.size and self.tree[x + k] < w: w -= self.tree[x + k] x += k k >>= 1 return x + 1 N = int(input()) A = list(map(int, input().split())) A = [(a, i+1) for i, a in enumerate(A)] bit_val = Bit(N) bit_num = Bit(N) A.sort(key=lambda x: x[0], reverse=True) prev = -1 L_val = [0] * (N+1) L_num = [0] * (N+1) cnt = 0 for a, i in A: if a == prev: cnt += 1 else: cnt = 0 prev = a L_val[i] = bit_val.sum(i) - a * cnt L_num[i] = bit_num.sum(i) - cnt bit_val.add(i, a) bit_num.add(i, 1) bit_val = Bit(N) bit_num = Bit(N) A.reverse() prev = -1 R_val = [0] * (N + 1) R_num = [0] * (N + 1) cnt = 0 S_val = 0 S_num = 0 for a, i in A: if a == prev: cnt += 1 else: cnt = 0 prev = a R_val[i] = S_val - bit_val.sum(i) - a * cnt R_num[i] = S_num - bit_num.sum(i) - cnt bit_val.add(i, a) bit_num.add(i, 1) S_val += a S_num += 1 ans = 0 for a, i in A: ans = (ans + ((a * L_num[i])%mod * R_num[i])%mod)%mod ans = (ans + (L_val[i] * R_num[i])%mod)%mod ans = (ans + (R_val[i] * L_num[i])%mod)%mod print(ans) if __name__ == '__main__': main()