結果
問題 | No.5011 Better Mo's Algorithm is Needed!! (Weighted) |
ユーザー | eijirou |
提出日時 | 2022-12-17 12:56:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 173 ms / 5,000 ms |
コード長 | 3,274 bytes |
コンパイル時間 | 4,557 ms |
実行使用メモリ | 14,624 KB |
スコア | 36,399,845,476 |
最終ジャッジ日時 | 2022-12-17 12:57:18 |
合計ジャッジ時間 | 64,805 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 153 ms
14,476 KB |
testcase_01 | AC | 172 ms
14,288 KB |
testcase_02 | AC | 157 ms
14,384 KB |
testcase_03 | AC | 151 ms
14,560 KB |
testcase_04 | AC | 173 ms
14,392 KB |
testcase_05 | AC | 150 ms
14,260 KB |
testcase_06 | AC | 151 ms
14,564 KB |
testcase_07 | AC | 157 ms
14,360 KB |
testcase_08 | AC | 154 ms
14,384 KB |
testcase_09 | AC | 153 ms
14,428 KB |
testcase_10 | AC | 164 ms
14,364 KB |
testcase_11 | AC | 155 ms
14,236 KB |
testcase_12 | AC | 153 ms
14,556 KB |
testcase_13 | AC | 153 ms
14,248 KB |
testcase_14 | AC | 155 ms
14,532 KB |
testcase_15 | AC | 151 ms
14,456 KB |
testcase_16 | AC | 151 ms
14,152 KB |
testcase_17 | AC | 151 ms
14,256 KB |
testcase_18 | AC | 155 ms
14,116 KB |
testcase_19 | AC | 156 ms
14,028 KB |
testcase_20 | AC | 163 ms
14,548 KB |
testcase_21 | AC | 154 ms
14,484 KB |
testcase_22 | AC | 156 ms
14,272 KB |
testcase_23 | AC | 155 ms
14,460 KB |
testcase_24 | AC | 156 ms
14,564 KB |
testcase_25 | AC | 155 ms
14,244 KB |
testcase_26 | AC | 162 ms
14,308 KB |
testcase_27 | AC | 155 ms
14,336 KB |
testcase_28 | AC | 152 ms
14,384 KB |
testcase_29 | AC | 155 ms
14,400 KB |
testcase_30 | AC | 155 ms
14,468 KB |
testcase_31 | AC | 155 ms
14,048 KB |
testcase_32 | AC | 159 ms
14,256 KB |
testcase_33 | AC | 160 ms
14,608 KB |
testcase_34 | AC | 159 ms
14,184 KB |
testcase_35 | AC | 156 ms
14,460 KB |
testcase_36 | AC | 154 ms
14,368 KB |
testcase_37 | AC | 152 ms
14,280 KB |
testcase_38 | AC | 154 ms
14,400 KB |
testcase_39 | AC | 155 ms
14,540 KB |
testcase_40 | AC | 155 ms
14,256 KB |
testcase_41 | AC | 157 ms
14,428 KB |
testcase_42 | AC | 154 ms
14,308 KB |
testcase_43 | AC | 153 ms
14,292 KB |
testcase_44 | AC | 154 ms
14,492 KB |
testcase_45 | AC | 153 ms
14,392 KB |
testcase_46 | AC | 163 ms
14,356 KB |
testcase_47 | AC | 152 ms
14,360 KB |
testcase_48 | AC | 154 ms
14,512 KB |
testcase_49 | AC | 158 ms
14,316 KB |
testcase_50 | AC | 153 ms
14,292 KB |
testcase_51 | AC | 161 ms
14,380 KB |
testcase_52 | AC | 158 ms
14,384 KB |
testcase_53 | AC | 151 ms
14,372 KB |
testcase_54 | AC | 150 ms
14,244 KB |
testcase_55 | AC | 150 ms
14,368 KB |
testcase_56 | AC | 154 ms
14,188 KB |
testcase_57 | AC | 152 ms
14,440 KB |
testcase_58 | AC | 155 ms
14,380 KB |
testcase_59 | AC | 156 ms
14,544 KB |
testcase_60 | AC | 152 ms
14,436 KB |
testcase_61 | AC | 152 ms
14,220 KB |
testcase_62 | AC | 156 ms
14,396 KB |
testcase_63 | AC | 152 ms
14,408 KB |
testcase_64 | AC | 151 ms
14,356 KB |
testcase_65 | AC | 150 ms
14,408 KB |
testcase_66 | AC | 153 ms
14,120 KB |
testcase_67 | AC | 160 ms
14,216 KB |
testcase_68 | AC | 158 ms
14,344 KB |
testcase_69 | AC | 153 ms
14,404 KB |
testcase_70 | AC | 154 ms
14,220 KB |
testcase_71 | AC | 153 ms
14,484 KB |
testcase_72 | AC | 154 ms
14,404 KB |
testcase_73 | AC | 151 ms
14,272 KB |
testcase_74 | AC | 155 ms
14,276 KB |
testcase_75 | AC | 153 ms
14,456 KB |
testcase_76 | AC | 152 ms
14,464 KB |
testcase_77 | AC | 152 ms
14,340 KB |
testcase_78 | AC | 157 ms
14,216 KB |
testcase_79 | AC | 158 ms
14,572 KB |
testcase_80 | AC | 154 ms
14,360 KB |
testcase_81 | AC | 151 ms
14,388 KB |
testcase_82 | AC | 153 ms
14,304 KB |
testcase_83 | AC | 153 ms
14,348 KB |
testcase_84 | AC | 151 ms
14,588 KB |
testcase_85 | AC | 152 ms
14,192 KB |
testcase_86 | AC | 150 ms
14,272 KB |
testcase_87 | AC | 151 ms
14,480 KB |
testcase_88 | AC | 154 ms
14,232 KB |
testcase_89 | AC | 154 ms
14,336 KB |
testcase_90 | AC | 154 ms
14,096 KB |
testcase_91 | AC | 155 ms
14,376 KB |
testcase_92 | AC | 153 ms
14,284 KB |
testcase_93 | AC | 153 ms
14,352 KB |
testcase_94 | AC | 152 ms
14,192 KB |
testcase_95 | AC | 157 ms
14,368 KB |
testcase_96 | AC | 152 ms
14,564 KB |
testcase_97 | AC | 156 ms
14,168 KB |
testcase_98 | AC | 151 ms
14,392 KB |
testcase_99 | AC | 153 ms
14,328 KB |
testcase_100 | AC | 154 ms
14,352 KB |
testcase_101 | AC | 155 ms
14,388 KB |
testcase_102 | AC | 150 ms
14,104 KB |
testcase_103 | AC | 151 ms
14,464 KB |
testcase_104 | AC | 162 ms
14,108 KB |
testcase_105 | AC | 155 ms
14,544 KB |
testcase_106 | AC | 153 ms
14,200 KB |
testcase_107 | AC | 155 ms
14,332 KB |
testcase_108 | AC | 159 ms
14,476 KB |
testcase_109 | AC | 153 ms
14,224 KB |
testcase_110 | AC | 153 ms
14,624 KB |
testcase_111 | AC | 164 ms
14,540 KB |
testcase_112 | AC | 153 ms
14,340 KB |
testcase_113 | AC | 152 ms
14,300 KB |
testcase_114 | AC | 156 ms
14,032 KB |
testcase_115 | AC | 153 ms
14,452 KB |
testcase_116 | AC | 155 ms
14,304 KB |
testcase_117 | AC | 153 ms
14,592 KB |
testcase_118 | AC | 155 ms
14,296 KB |
testcase_119 | AC | 154 ms
14,408 KB |
ソースコード
#pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; #define ll long long int constexpr double time_limit = 4.8; struct Input { int n, q, wt, st; vector<ll> w; vector<pair<int,int>> lr; void input() { cin >> n >> q >> wt >> st; w.resize(n); for (int i = 0; i < n; ++i) { cin >> w[i]; } lr.resize(q); for (int i = 0; i < q; ++i) { int l, r; cin >> l >> r; lr[i] = {l - 1, r - 1}; } } }; struct Solver { int n, q, wt, st; vector<ll> w; vector<pair<int,int>> lr; vector<ll> cs; // cumulative sum of w vector<int> p; ll cost; Solver(const Input& input) { n = input.n; q = input.q; wt = input.wt; st = input.st; w = input.w; lr = input.lr; // initialize cs cs.resize(n + 1, 0); for (int i = 0; i < n; ++i) { cs[i + 1] = cs[i] + w[i]; } } void mo() { int sqrt_n = (int)sqrt(n) + 1; vector<vector<pair<int,int>>> groups(sqrt_n + 1); for (int i = 0; i < q; ++i) { auto [l, r] = lr[i]; groups[sqrt_n * cs[l] / cs.back()].push_back({r, i}); } bool flag = false; for (vector<pair<int,int>>& group : groups) { if (group.empty()) { continue; } sort(group.begin(), group.end()); if (flag) { reverse(group.begin(), group.end()); } for (auto [_, i] : group) { p.push_back(i); } flag ^= true; } } ll get_cost(int i, int j) { auto [a, b] = lr[i]; auto [c, d] = lr[j]; return cs[max(a, c)] - cs[min(a, c)] + cs[max(b, d) + 1] - cs[min(b, d) + 1]; } void initialize_cost() { cost = 0; for (int i = 0; i < q - 1; ++i) { cost += get_cost(p[i], p[i + 1]); } } ll reverse_delta(int i, int j) { ll delta = 0; delta -= get_cost(p[i - 1], p[i]); delta -= get_cost(p[j], p[j + 1]); delta += get_cost(p[i - 1], p[j]); delta += get_cost(p[i], p[j + 1]); return delta; } void reverse_nodes(int i, int j, ll delta) { reverse(p.begin() + i, p.begin() + j + 1); cost += delta; } void improve() { int cnt = 10; while (cnt--) { for (int i = 1; i < q - 2; ++i) { ll delta = reverse_delta(i, i + 1); if (delta <= 0) { reverse_nodes(i, i + 1, delta); } } } } void print() { for (int i = 0; i < q; ++i) { cout << p[i] + 1; if (i == q - 1) { cout << "\n"; } else { cout << " "; } } } }; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); Input input; input.input(); Solver solver(input); solver.mo(); solver.initialize_cost(); solver.improve(); solver.print(); return 0; }