結果
問題 | No.1867 Partitions and Inversions |
ユーザー | Cyanmond |
提出日時 | 2021-12-26 14:27:12 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,130 ms / 5,000 ms |
コード長 | 2,814 bytes |
コンパイル時間 | 2,728 ms |
コンパイル使用メモリ | 212,452 KB |
実行使用メモリ | 214,656 KB |
最終ジャッジ日時 | 2024-04-08 20:56:29 |
合計ジャッジ時間 | 44,179 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 1,038 ms
214,656 KB |
testcase_03 | AC | 1,033 ms
214,656 KB |
testcase_04 | AC | 1,050 ms
214,656 KB |
testcase_05 | AC | 1,031 ms
214,656 KB |
testcase_06 | AC | 1,052 ms
214,656 KB |
testcase_07 | AC | 1,046 ms
214,656 KB |
testcase_08 | AC | 1,130 ms
214,656 KB |
testcase_09 | AC | 1,047 ms
214,656 KB |
testcase_10 | AC | 1,050 ms
214,656 KB |
testcase_11 | AC | 1,037 ms
214,656 KB |
testcase_12 | AC | 1,032 ms
214,656 KB |
testcase_13 | AC | 1,044 ms
214,656 KB |
testcase_14 | AC | 1,023 ms
214,656 KB |
testcase_15 | AC | 1,059 ms
214,656 KB |
testcase_16 | AC | 1,010 ms
214,656 KB |
testcase_17 | AC | 1,047 ms
214,656 KB |
testcase_18 | AC | 1,066 ms
214,656 KB |
testcase_19 | AC | 1,046 ms
214,656 KB |
testcase_20 | AC | 1,029 ms
214,656 KB |
testcase_21 | AC | 1,026 ms
214,656 KB |
testcase_22 | AC | 1,031 ms
214,656 KB |
testcase_23 | AC | 1,033 ms
214,656 KB |
testcase_24 | AC | 1,009 ms
214,656 KB |
testcase_25 | AC | 1,032 ms
214,656 KB |
testcase_26 | AC | 1,047 ms
214,656 KB |
testcase_27 | AC | 1,023 ms
214,656 KB |
testcase_28 | AC | 1,043 ms
214,656 KB |
testcase_29 | AC | 1,039 ms
214,656 KB |
testcase_30 | AC | 1,043 ms
214,656 KB |
testcase_31 | AC | 1,053 ms
214,656 KB |
testcase_32 | AC | 2 ms
6,676 KB |
testcase_33 | AC | 2 ms
6,676 KB |
testcase_34 | AC | 2 ms
6,676 KB |
testcase_35 | AC | 2 ms
6,676 KB |
testcase_36 | AC | 2 ms
6,676 KB |
testcase_37 | AC | 2 ms
6,676 KB |
testcase_38 | AC | 15 ms
9,472 KB |
testcase_39 | AC | 14 ms
9,472 KB |
testcase_40 | AC | 15 ms
9,472 KB |
testcase_41 | AC | 15 ms
9,472 KB |
testcase_42 | AC | 14 ms
9,472 KB |
testcase_43 | AC | 335 ms
97,408 KB |
testcase_44 | AC | 347 ms
97,408 KB |
testcase_45 | AC | 341 ms
97,408 KB |
testcase_46 | AC | 358 ms
97,408 KB |
testcase_47 | AC | 346 ms
97,408 KB |
testcase_48 | AC | 341 ms
97,408 KB |
testcase_49 | AC | 357 ms
97,408 KB |
testcase_50 | AC | 351 ms
97,408 KB |
testcase_51 | AC | 357 ms
97,408 KB |
testcase_52 | AC | 349 ms
97,408 KB |
testcase_53 | AC | 345 ms
97,408 KB |
testcase_54 | AC | 350 ms
97,408 KB |
testcase_55 | AC | 349 ms
97,408 KB |
testcase_56 | AC | 356 ms
97,408 KB |
testcase_57 | AC | 348 ms
97,408 KB |
testcase_58 | AC | 353 ms
97,408 KB |
testcase_59 | AC | 341 ms
97,408 KB |
testcase_60 | AC | 344 ms
97,408 KB |
testcase_61 | AC | 347 ms
97,408 KB |
testcase_62 | AC | 358 ms
97,408 KB |
testcase_63 | AC | 976 ms
214,656 KB |
testcase_64 | AC | 2 ms
6,676 KB |
testcase_65 | AC | 2 ms
6,676 KB |
testcase_66 | AC | 2 ms
6,676 KB |
testcase_67 | AC | 1,004 ms
214,656 KB |
ソースコード
#include <bits/stdc++.h> class Manager { size_t n; std::vector<std::vector<size_t>> C; struct node { size_t i, m; size_t limit; }; public: Manager(const std::vector<std::vector<size_t>> &D) : n(D.size()), C(D) { assert(C.size() + 1 == C[0].size()); } std::stack<node> data; void add(const size_t i, const size_t m) { if (data.empty()) { data.push({i, m, n}); return; } else { while (data.top().limit < i + 1) { data.pop(); } const auto d = data.top(); if (C[d.i][i + 1] + d.m < C[i][i + 1] + m) { return; } } bool pushed = false; while (not data.empty()) { const auto d = data.top(); if (C[d.i][d.limit] + d.m > C[i][d.limit] + m) { data.pop(); } else { size_t ok = i + 1, ng = d.limit; while (ng - ok > 1) { const auto mid = (ok + ng) / 2; if (C[d.i][mid] + d.m > C[i][mid] + m) { ok = mid; } else { ng = mid; } } data.push({i, m, ok}); pushed = true; break; } } if (not pushed) { data.push({i, m, n}); } } size_t get_min(const size_t x) { while (data.top().limit < x) { data.pop(); } const auto d = data.top(); return C[d.i][x] + d.m; } void clear_log() { while (not data.empty()) { data.pop(); } } }; int main() { size_t N; std::cin >> N; std::vector<size_t> P(N); for (auto &e : P) { std::cin >> e; } std::vector<std::vector<size_t>> D(N, std::vector<size_t>(N + 1)); for (size_t i = 0; i < N - 1; ++i) { std::vector<size_t> R(N + 1); for (size_t j = 0; j <= i; ++j) { ++R[P[j]]; } for (size_t j = 1; j <= N; ++j) { R[j] += R[j - 1]; } size_t sum = 0; for (size_t j = i + 1; j < N; ++j) { sum += R[N] - R[P[j]]; D[i + 1][j + 1] = sum; } } Manager m(D); std::vector<std::vector<size_t>> dp(N + 1, std::vector<size_t>(N + 1, N * N)); dp[0][0] = 0; for (size_t j = 0; j < N; ++j) { m.add(j, dp[j][j]); for (size_t i = j + 1; i <= N; ++i) { dp[i][j + 1] = m.get_min(i); if (i != N) { m.add(i, dp[i][j]); } } m.clear_log(); } for (size_t i = 1; i <= N; ++i) { std::cout << dp[N][i] << std::endl; } }