結果
問題 | No.1867 Partitions and Inversions |
ユーザー | shiomusubi496 |
提出日時 | 2022-03-02 16:22:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,636 ms / 5,000 ms |
コード長 | 2,201 bytes |
コンパイル時間 | 390 ms |
コンパイル使用メモリ | 86,824 KB |
実行使用メモリ | 221,100 KB |
最終ジャッジ日時 | 2023-09-23 08:59:21 |
合計ジャッジ時間 | 107,669 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,036 KB |
testcase_01 | AC | 77 ms
71,212 KB |
testcase_02 | AC | 2,504 ms
220,116 KB |
testcase_03 | AC | 2,530 ms
220,744 KB |
testcase_04 | AC | 2,523 ms
220,676 KB |
testcase_05 | AC | 2,490 ms
220,208 KB |
testcase_06 | AC | 2,549 ms
220,660 KB |
testcase_07 | AC | 2,351 ms
220,196 KB |
testcase_08 | AC | 2,529 ms
220,988 KB |
testcase_09 | AC | 2,382 ms
220,248 KB |
testcase_10 | AC | 2,482 ms
220,180 KB |
testcase_11 | AC | 2,400 ms
220,020 KB |
testcase_12 | AC | 2,450 ms
221,100 KB |
testcase_13 | AC | 2,516 ms
220,104 KB |
testcase_14 | AC | 2,569 ms
220,076 KB |
testcase_15 | AC | 2,525 ms
220,376 KB |
testcase_16 | AC | 2,429 ms
220,388 KB |
testcase_17 | AC | 2,595 ms
220,772 KB |
testcase_18 | AC | 2,593 ms
220,408 KB |
testcase_19 | AC | 2,611 ms
220,616 KB |
testcase_20 | AC | 2,573 ms
220,984 KB |
testcase_21 | AC | 2,502 ms
219,980 KB |
testcase_22 | AC | 2,610 ms
220,208 KB |
testcase_23 | AC | 2,610 ms
220,208 KB |
testcase_24 | AC | 2,571 ms
220,388 KB |
testcase_25 | AC | 2,537 ms
220,144 KB |
testcase_26 | AC | 2,621 ms
220,404 KB |
testcase_27 | AC | 2,545 ms
219,988 KB |
testcase_28 | AC | 2,520 ms
220,640 KB |
testcase_29 | AC | 2,556 ms
220,036 KB |
testcase_30 | AC | 2,636 ms
220,156 KB |
testcase_31 | AC | 2,612 ms
220,572 KB |
testcase_32 | AC | 74 ms
71,068 KB |
testcase_33 | AC | 75 ms
71,220 KB |
testcase_34 | AC | 76 ms
70,908 KB |
testcase_35 | AC | 76 ms
71,224 KB |
testcase_36 | AC | 76 ms
70,952 KB |
testcase_37 | AC | 75 ms
71,172 KB |
testcase_38 | AC | 193 ms
81,716 KB |
testcase_39 | AC | 211 ms
82,160 KB |
testcase_40 | AC | 194 ms
81,740 KB |
testcase_41 | AC | 202 ms
82,048 KB |
testcase_42 | AC | 197 ms
81,900 KB |
testcase_43 | AC | 1,143 ms
141,220 KB |
testcase_44 | AC | 1,164 ms
141,936 KB |
testcase_45 | AC | 1,134 ms
141,508 KB |
testcase_46 | AC | 1,192 ms
141,564 KB |
testcase_47 | AC | 1,201 ms
141,984 KB |
testcase_48 | AC | 1,198 ms
142,308 KB |
testcase_49 | AC | 1,196 ms
141,596 KB |
testcase_50 | AC | 1,177 ms
141,436 KB |
testcase_51 | AC | 1,259 ms
141,632 KB |
testcase_52 | AC | 1,166 ms
141,148 KB |
testcase_53 | AC | 1,143 ms
141,196 KB |
testcase_54 | AC | 1,176 ms
141,412 KB |
testcase_55 | AC | 1,152 ms
141,828 KB |
testcase_56 | AC | 1,172 ms
141,736 KB |
testcase_57 | AC | 1,168 ms
141,484 KB |
testcase_58 | AC | 1,155 ms
141,408 KB |
testcase_59 | AC | 1,166 ms
141,264 KB |
testcase_60 | AC | 1,146 ms
141,556 KB |
testcase_61 | AC | 1,143 ms
141,380 KB |
testcase_62 | AC | 1,185 ms
141,672 KB |
testcase_63 | AC | 1,903 ms
220,256 KB |
testcase_64 | AC | 74 ms
71,072 KB |
testcase_65 | AC | 73 ms
71,220 KB |
testcase_66 | AC | 75 ms
70,916 KB |
testcase_67 | AC | 1,888 ms
220,020 KB |
ソースコード
class Manager: class node: def __init__(self, a, b, c) -> None: self.i = a self.m = b self.limit = c def __init__(self, D) -> None: self.n = len(D) self.C = D self.data = [] assert len(D) + 1 == len(D[0]) def add(self, i, m) -> None: if not self.data: self.data.append(self.node(i, m, self.n)) return else: while self.data[-1].limit < i + 1: self.data.pop() d = self.data[-1] if self.C[d.i][i + 1] + d.m < self.C[i][i + 1] + m: return pushed = False while self.data: d = self.data[-1] if self.C[d.i][d.limit] + d.m > self.C[i][d.limit] + m: self.data.pop() else: ok = i + 1 ng = d.limit while ng - ok > 1: mid = (ok + ng) >> 1 if self.C[d.i][mid] + d.m > self.C[i][mid] + m: ok = mid else: ng = mid self.data.append(self.node(i, m, ok)) pushed = True break if not pushed: self.data.append(self.node(i, m, self.n)) def get_min(self, x) -> int: while self.data[-1].limit < x: self.data.pop() d = self.data[-1] return self.C[d.i][x] + d.m def clear_log(self) -> None: while self.data: self.data.pop() N = int(input()) P = list(map(int, input().split())) D = [[0] * (N + 1) for _ in range(N)] for i in range(N - 1): R = [0] * (N + 1) for j in range(i + 1): R[P[j]] += 1 for j in range(1, N + 1): R[j] += R[j - 1] sm = 0 for j in range(i + 1, N): sm += R[N] - R[P[j]] D[i + 1][j + 1] = sm m = Manager(D) dp = [[N * N] * (N + 1) for _ in range(N + 1)] dp[0][0] = 0 for j in range(N): m.add(j, dp[j][j]) for i in range(j + 1, N + 1): dp[i][j + 1] = m.get_min(i) if i != N: m.add(i, dp[i][j]) m.clear_log() for i in range(1, N + 1): print(dp[N][i])