結果
問題 | No.1300 Sum of Inversions |
ユーザー | Coki628 |
提出日時 | 2020-11-27 23:37:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,053 ms / 2,000 ms |
コード長 | 2,528 bytes |
コンパイル時間 | 317 ms |
コンパイル使用メモリ | 87,536 KB |
実行使用メモリ | 214,052 KB |
最終ジャッジ日時 | 2023-10-10 21:48:30 |
合計ジャッジ時間 | 27,529 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,964 KB |
testcase_01 | AC | 72 ms
71,860 KB |
testcase_02 | AC | 73 ms
71,800 KB |
testcase_03 | AC | 826 ms
165,348 KB |
testcase_04 | AC | 819 ms
165,052 KB |
testcase_05 | AC | 672 ms
128,616 KB |
testcase_06 | AC | 924 ms
193,448 KB |
testcase_07 | AC | 893 ms
192,452 KB |
testcase_08 | AC | 991 ms
200,880 KB |
testcase_09 | AC | 1,001 ms
200,544 KB |
testcase_10 | AC | 569 ms
123,268 KB |
testcase_11 | AC | 569 ms
123,220 KB |
testcase_12 | AC | 818 ms
164,792 KB |
testcase_13 | AC | 820 ms
164,304 KB |
testcase_14 | AC | 1,053 ms
213,288 KB |
testcase_15 | AC | 972 ms
200,588 KB |
testcase_16 | AC | 851 ms
165,468 KB |
testcase_17 | AC | 535 ms
119,084 KB |
testcase_18 | AC | 600 ms
123,996 KB |
testcase_19 | AC | 732 ms
138,564 KB |
testcase_20 | AC | 733 ms
138,768 KB |
testcase_21 | AC | 727 ms
139,944 KB |
testcase_22 | AC | 662 ms
128,320 KB |
testcase_23 | AC | 929 ms
193,568 KB |
testcase_24 | AC | 687 ms
128,404 KB |
testcase_25 | AC | 582 ms
123,748 KB |
testcase_26 | AC | 580 ms
123,456 KB |
testcase_27 | AC | 642 ms
128,072 KB |
testcase_28 | AC | 1,001 ms
211,952 KB |
testcase_29 | AC | 725 ms
138,248 KB |
testcase_30 | AC | 1,000 ms
200,884 KB |
testcase_31 | AC | 658 ms
128,228 KB |
testcase_32 | AC | 685 ms
128,932 KB |
testcase_33 | AC | 343 ms
105,608 KB |
testcase_34 | AC | 360 ms
105,300 KB |
testcase_35 | AC | 581 ms
191,000 KB |
testcase_36 | AC | 657 ms
214,052 KB |
ソースコード
import sys def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for k in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for k in range(c)] for k in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10**9) INF = 10**19 MOD = 998244353 EPS = 10**-10 class BIT: """ Binary Indexed Tree (MOD付) """ def __init__(self, n): self.n = n # 0-indexed n += 1 nv = 1 while nv < n: nv *= 2 self.size = nv self.tree = [0] * nv def sum(self, i): """ [0, i]を合計する """ s = 0 i += 1 while i > 0: s += self.tree[i-1] s %= MOD i -= i & -i return s def add(self, i, x): """ 値の追加:添字i, 値x """ i += 1 while i <= self.size: self.tree[i-1] += x self.tree[i-1] %= MOD i += i & -i def query(self, l, r): """ 区間和の取得 [l, r) """ return (self.sum(r-1) - self.sum(l-1)) % MOD def get(self, i): """ 一点取得 """ return self.query(i, i+1) def update(self, i, x): """ 値の更新:添字i, 値x """ self.add(i, x - self.get(i)) def print(self): for i in range(self.n): print(self.get(i), end=' ') print() def compress(S): """ 座標圧縮 """ zipped, unzipped = {}, {} for i, a in enumerate(sorted(S)): zipped[a] = i unzipped[i] = a return zipped, unzipped N = INT() A = LIST() zp, unzp = compress(set(A)) MX = len(zp) bitcntl = BIT(MX) bitcntr = BIT(MX) bitsml = BIT(MX) bitsmr = BIT(MX) for i in range(N): bitcntr.add(zp[A[i]], 1) bitsmr.add(zp[A[i]], A[i]) ans = 0 for i in range(N): cntl = bitcntl.query(zp[A[i]]+1, MX) cntr = bitcntr.query(0, zp[A[i]]) sml = bitsml.query(zp[A[i]]+1, MX) smr = bitsmr.query(0, zp[A[i]]) ans += sml*cntr + cntl*smr + A[i]*(cntl*cntr) ans %= MOD bitcntl.add(zp[A[i]], 1) bitcntr.add(zp[A[i]], -1) bitsml.add(zp[A[i]], A[i]) bitsmr.add(zp[A[i]], -A[i]) print(ans)