結果
問題 |
No.5010 Better Mo's Algorithm is Needed!! (Unweighted)
|
ユーザー |
![]() |
提出日時 | 2022-12-17 17:03:25 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4,975 ms / 5,000 ms |
コード長 | 3,433 bytes |
コンパイル時間 | 2,111 ms |
実行使用メモリ | 7,720 KB |
スコア | 19,046,295,859 |
最終ジャッジ日時 | 2022-12-17 17:14:09 |
合計ジャッジ時間 | 643,977 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge11 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 120 |
ソースコード
#include <cstdlib> #include <cmath> #include <algorithm> #include <chrono> #include <cassert> #include <array> #include <vector> #include <numeric> #include <cstdio> #include <iostream> using namespace std; int timelimit = 5 * 1000, elapsed = 0, margin = 50; class Timer { chrono::system_clock::time_point start_time = chrono::system_clock::now(); public: Timer() {} long long get_elapsed_time() { auto diff = chrono::system_clock::now() - start_time; return chrono::duration_cast<chrono::milliseconds>(diff).count(); } } timer; constexpr int N = 200000, Q = 200000; int WT, ST; int L[Q], R[Q]; long long initial_cost(int i) { return 100 * (R[i] - L[i] + 1); } long long adj_cost(int i, int j) { return 100 * (abs(L[i] - L[j]) + abs(R[i] - R[j])); } long long calc_cost(const array<int, Q> &ans) { long long c = initial_cost(ans[0]); for (int i = 1; i < Q; ++i) c += adj_cost(ans[i - 1], ans[i]); return c; } long long score_of_cost(long long cost) { constexpr long long n = (long long)1e18; return n % cost * 2 >= cost ? n / cost + 1 : n / cost; } void read_input() { scanf("%*d %*d %d %d", &WT, &ST); assert(WT == 1); for (int i = 0; i < N; i++) scanf(" %*d"); for (int i = 0; i < Q; i++) scanf(" %d %d", L + i, R + i); } array<int, Q> solve(int B, int S) { array<int, N> a; iota(a.begin(), a.end(), 0); vector<vector<int>> buckets((N + B - 1) / B + 1); for (int i = 0; i < Q; i++) { const int b = L[i] / B; buckets[b].push_back(i); } array<int, Q> ans; int pos = 0; for (int b = 0; b < buckets.size(); ++b) { vector<int> &elems = buckets[b]; sort(elems.begin(), elems.end(), [b](int i, int j) { if (b % 2 == 0) return make_pair(R[i], L[i]) < make_pair(R[j], L[j]); else return make_pair(R[i], L[i]) > make_pair(R[j], L[j]); }); for (int i : elems) ans[pos++] = i; } long long cur_cost = calc_cost(ans); for (;;) { cerr << cur_cost << ' ' << score_of_cost(cur_cost) << endl; for (int i = 0; i < N; ++i) { if (timer.get_elapsed_time() + margin > timelimit) { if (initial_cost(ans.front()) > initial_cost(ans.back())) reverse(ans.begin(), ans.end()); return ans; } const int jmax = min(N, i + S); for (int j = i + 1; j < jmax; ++j) { long long diff = 0; if (i > 0) { diff -= adj_cost(ans[i - 1], ans[i]); diff += adj_cost(ans[i - 1], ans[j]); } else { diff -= initial_cost(ans[0]); diff += initial_cost(ans[j]); } if (j + 1 < N) { diff -= adj_cost(ans[j], ans[j + 1]); diff += adj_cost(ans[i], ans[j + 1]); } if (diff <= 0) { reverse(ans.begin() + i, ans.begin() + j + 1); cur_cost += diff; } } } } } int main(int argc, char **argv) { read_input(); const int B = argc <= 1 ? 3500 : atoi(argv[1]); const int S = argc <= 2 ? 400 : atoi(argv[2]); const array<int, Q> ans = solve(B, S); for (int i : ans) cout << i + 1 << ' '; cout << endl; cerr << score_of_cost(calc_cost(ans)) << endl; }