結果

問題 No.5010 Better Mo's Algorithm is Needed!! (Unweighted)
ユーザー eijiroueijirou
提出日時 2022-12-17 12:54:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 171 ms / 5,000 ms
コード長 3,274 bytes
コンパイル時間 4,181 ms
実行使用メモリ 14,672 KB
スコア 16,655,047,300
最終ジャッジ日時 2022-12-17 12:55:42
合計ジャッジ時間 59,307 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 144 ms
14,404 KB
testcase_01 AC 144 ms
14,384 KB
testcase_02 AC 147 ms
14,232 KB
testcase_03 AC 151 ms
14,404 KB
testcase_04 AC 145 ms
14,372 KB
testcase_05 AC 152 ms
14,380 KB
testcase_06 AC 147 ms
14,420 KB
testcase_07 AC 146 ms
14,348 KB
testcase_08 AC 149 ms
14,252 KB
testcase_09 AC 145 ms
14,408 KB
testcase_10 AC 146 ms
14,340 KB
testcase_11 AC 143 ms
14,364 KB
testcase_12 AC 146 ms
14,588 KB
testcase_13 AC 147 ms
14,360 KB
testcase_14 AC 147 ms
14,492 KB
testcase_15 AC 155 ms
14,400 KB
testcase_16 AC 148 ms
14,340 KB
testcase_17 AC 151 ms
14,292 KB
testcase_18 AC 146 ms
14,404 KB
testcase_19 AC 161 ms
14,232 KB
testcase_20 AC 148 ms
14,340 KB
testcase_21 AC 148 ms
14,532 KB
testcase_22 AC 150 ms
14,404 KB
testcase_23 AC 148 ms
14,464 KB
testcase_24 AC 147 ms
14,496 KB
testcase_25 AC 152 ms
14,272 KB
testcase_26 AC 167 ms
14,228 KB
testcase_27 AC 147 ms
14,432 KB
testcase_28 AC 147 ms
14,364 KB
testcase_29 AC 150 ms
14,388 KB
testcase_30 AC 146 ms
14,552 KB
testcase_31 AC 149 ms
14,496 KB
testcase_32 AC 150 ms
14,324 KB
testcase_33 AC 153 ms
14,316 KB
testcase_34 AC 147 ms
14,296 KB
testcase_35 AC 142 ms
14,412 KB
testcase_36 AC 146 ms
14,592 KB
testcase_37 AC 146 ms
14,232 KB
testcase_38 AC 149 ms
14,344 KB
testcase_39 AC 146 ms
14,520 KB
testcase_40 AC 154 ms
14,440 KB
testcase_41 AC 150 ms
14,436 KB
testcase_42 AC 146 ms
14,408 KB
testcase_43 AC 152 ms
14,400 KB
testcase_44 AC 152 ms
14,396 KB
testcase_45 AC 147 ms
14,568 KB
testcase_46 AC 146 ms
14,296 KB
testcase_47 AC 154 ms
14,504 KB
testcase_48 AC 146 ms
14,556 KB
testcase_49 AC 146 ms
14,236 KB
testcase_50 AC 144 ms
14,396 KB
testcase_51 AC 153 ms
14,504 KB
testcase_52 AC 144 ms
14,376 KB
testcase_53 AC 148 ms
14,472 KB
testcase_54 AC 151 ms
14,404 KB
testcase_55 AC 157 ms
14,176 KB
testcase_56 AC 152 ms
14,264 KB
testcase_57 AC 149 ms
14,504 KB
testcase_58 AC 154 ms
14,268 KB
testcase_59 AC 146 ms
14,284 KB
testcase_60 AC 145 ms
14,600 KB
testcase_61 AC 151 ms
14,220 KB
testcase_62 AC 151 ms
14,396 KB
testcase_63 AC 150 ms
14,536 KB
testcase_64 AC 144 ms
14,324 KB
testcase_65 AC 162 ms
14,380 KB
testcase_66 AC 143 ms
14,512 KB
testcase_67 AC 144 ms
14,300 KB
testcase_68 AC 147 ms
14,256 KB
testcase_69 AC 152 ms
14,384 KB
testcase_70 AC 150 ms
14,344 KB
testcase_71 AC 153 ms
14,480 KB
testcase_72 AC 171 ms
14,568 KB
testcase_73 AC 148 ms
14,348 KB
testcase_74 AC 152 ms
14,316 KB
testcase_75 AC 150 ms
14,580 KB
testcase_76 AC 150 ms
14,308 KB
testcase_77 AC 154 ms
14,344 KB
testcase_78 AC 152 ms
14,416 KB
testcase_79 AC 156 ms
14,188 KB
testcase_80 AC 150 ms
14,508 KB
testcase_81 AC 149 ms
14,624 KB
testcase_82 AC 152 ms
14,384 KB
testcase_83 AC 149 ms
14,320 KB
testcase_84 AC 150 ms
14,552 KB
testcase_85 AC 149 ms
14,264 KB
testcase_86 AC 153 ms
14,240 KB
testcase_87 AC 153 ms
14,504 KB
testcase_88 AC 148 ms
14,268 KB
testcase_89 AC 154 ms
14,252 KB
testcase_90 AC 151 ms
14,512 KB
testcase_91 AC 147 ms
14,336 KB
testcase_92 AC 145 ms
14,340 KB
testcase_93 AC 153 ms
14,624 KB
testcase_94 AC 150 ms
14,200 KB
testcase_95 AC 150 ms
14,412 KB
testcase_96 AC 148 ms
14,672 KB
testcase_97 AC 154 ms
14,336 KB
testcase_98 AC 145 ms
14,300 KB
testcase_99 AC 147 ms
14,560 KB
testcase_100 AC 157 ms
14,344 KB
testcase_101 AC 151 ms
14,340 KB
testcase_102 AC 152 ms
14,476 KB
testcase_103 AC 149 ms
14,160 KB
testcase_104 AC 156 ms
14,312 KB
testcase_105 AC 149 ms
14,392 KB
testcase_106 AC 148 ms
14,308 KB
testcase_107 AC 155 ms
14,392 KB
testcase_108 AC 146 ms
14,476 KB
testcase_109 AC 150 ms
14,208 KB
testcase_110 AC 147 ms
14,376 KB
testcase_111 AC 155 ms
14,480 KB
testcase_112 AC 147 ms
14,200 KB
testcase_113 AC 152 ms
14,408 KB
testcase_114 AC 165 ms
14,388 KB
testcase_115 AC 148 ms
14,152 KB
testcase_116 AC 148 ms
14,324 KB
testcase_117 AC 148 ms
14,428 KB
testcase_118 AC 153 ms
14,244 KB
testcase_119 AC 148 ms
14,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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;
}
0