結果
問題 | No.5010 Better Mo's Algorithm is Needed!! (Unweighted) |
ユーザー | t33f |
提出日時 | 2022-12-17 15:50:01 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 4,973 ms / 5,000 ms |
コード長 | 3,437 bytes |
コンパイル時間 | 3,062 ms |
実行使用メモリ | 10,224 KB |
スコア | 18,493,262,479 |
最終ジャッジ日時 | 2022-12-17 16:00:51 |
合計ジャッジ時間 | 645,649 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge16 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4,970 ms
10,052 KB |
testcase_01 | AC | 4,972 ms
9,956 KB |
testcase_02 | AC | 4,971 ms
10,000 KB |
testcase_03 | AC | 4,971 ms
9,960 KB |
testcase_04 | AC | 4,971 ms
10,032 KB |
testcase_05 | AC | 4,972 ms
10,040 KB |
testcase_06 | AC | 4,970 ms
10,176 KB |
testcase_07 | AC | 4,971 ms
9,984 KB |
testcase_08 | AC | 4,971 ms
9,960 KB |
testcase_09 | AC | 4,971 ms
10,092 KB |
testcase_10 | AC | 4,971 ms
9,996 KB |
testcase_11 | AC | 4,971 ms
10,164 KB |
testcase_12 | AC | 4,972 ms
10,172 KB |
testcase_13 | AC | 4,972 ms
10,024 KB |
testcase_14 | AC | 4,971 ms
9,924 KB |
testcase_15 | AC | 4,973 ms
10,060 KB |
testcase_16 | AC | 4,971 ms
9,988 KB |
testcase_17 | AC | 4,972 ms
10,160 KB |
testcase_18 | AC | 4,971 ms
10,148 KB |
testcase_19 | AC | 4,971 ms
9,968 KB |
testcase_20 | AC | 4,971 ms
9,972 KB |
testcase_21 | AC | 4,970 ms
10,060 KB |
testcase_22 | AC | 4,972 ms
9,996 KB |
testcase_23 | AC | 4,971 ms
10,072 KB |
testcase_24 | AC | 4,971 ms
10,084 KB |
testcase_25 | AC | 4,972 ms
9,972 KB |
testcase_26 | AC | 4,971 ms
9,968 KB |
testcase_27 | AC | 4,971 ms
10,200 KB |
testcase_28 | AC | 4,971 ms
9,996 KB |
testcase_29 | AC | 4,970 ms
10,020 KB |
testcase_30 | AC | 4,971 ms
10,004 KB |
testcase_31 | AC | 4,971 ms
9,968 KB |
testcase_32 | AC | 4,970 ms
10,048 KB |
testcase_33 | AC | 4,971 ms
10,084 KB |
testcase_34 | AC | 4,971 ms
10,064 KB |
testcase_35 | AC | 4,971 ms
10,040 KB |
testcase_36 | AC | 4,971 ms
10,160 KB |
testcase_37 | AC | 4,970 ms
9,952 KB |
testcase_38 | AC | 4,971 ms
9,980 KB |
testcase_39 | AC | 4,971 ms
10,100 KB |
testcase_40 | AC | 4,970 ms
10,076 KB |
testcase_41 | AC | 4,972 ms
10,040 KB |
testcase_42 | AC | 4,971 ms
10,032 KB |
testcase_43 | AC | 4,971 ms
9,964 KB |
testcase_44 | AC | 4,970 ms
10,016 KB |
testcase_45 | AC | 4,970 ms
10,016 KB |
testcase_46 | AC | 4,971 ms
10,152 KB |
testcase_47 | AC | 4,971 ms
10,036 KB |
testcase_48 | AC | 4,970 ms
10,112 KB |
testcase_49 | AC | 4,971 ms
10,004 KB |
testcase_50 | AC | 4,971 ms
10,124 KB |
testcase_51 | AC | 4,971 ms
10,056 KB |
testcase_52 | AC | 4,972 ms
10,008 KB |
testcase_53 | AC | 4,970 ms
10,020 KB |
testcase_54 | AC | 4,971 ms
10,144 KB |
testcase_55 | AC | 4,971 ms
9,960 KB |
testcase_56 | AC | 4,971 ms
10,084 KB |
testcase_57 | AC | 4,971 ms
10,188 KB |
testcase_58 | AC | 4,970 ms
10,032 KB |
testcase_59 | AC | 4,970 ms
10,016 KB |
testcase_60 | AC | 4,971 ms
9,996 KB |
testcase_61 | AC | 4,970 ms
9,924 KB |
testcase_62 | AC | 4,971 ms
10,016 KB |
testcase_63 | AC | 4,971 ms
9,968 KB |
testcase_64 | AC | 4,971 ms
10,152 KB |
testcase_65 | AC | 4,971 ms
9,900 KB |
testcase_66 | AC | 4,971 ms
10,224 KB |
testcase_67 | AC | 4,970 ms
9,992 KB |
testcase_68 | AC | 4,972 ms
10,180 KB |
testcase_69 | AC | 4,971 ms
9,988 KB |
testcase_70 | AC | 4,971 ms
10,016 KB |
testcase_71 | AC | 4,970 ms
10,052 KB |
testcase_72 | AC | 4,970 ms
10,216 KB |
testcase_73 | AC | 4,971 ms
9,940 KB |
testcase_74 | AC | 4,971 ms
10,108 KB |
testcase_75 | AC | 4,971 ms
10,004 KB |
testcase_76 | AC | 4,971 ms
9,996 KB |
testcase_77 | AC | 4,971 ms
10,108 KB |
testcase_78 | AC | 4,971 ms
10,188 KB |
testcase_79 | AC | 4,971 ms
9,904 KB |
testcase_80 | AC | 4,970 ms
10,052 KB |
testcase_81 | AC | 4,972 ms
10,068 KB |
testcase_82 | AC | 4,972 ms
10,044 KB |
testcase_83 | AC | 4,970 ms
10,192 KB |
testcase_84 | AC | 4,971 ms
10,112 KB |
testcase_85 | AC | 4,971 ms
9,952 KB |
testcase_86 | AC | 4,971 ms
9,952 KB |
testcase_87 | AC | 4,971 ms
10,048 KB |
testcase_88 | AC | 4,971 ms
9,944 KB |
testcase_89 | AC | 4,971 ms
10,064 KB |
testcase_90 | AC | 4,972 ms
10,104 KB |
testcase_91 | AC | 4,970 ms
9,980 KB |
testcase_92 | AC | 4,970 ms
9,996 KB |
testcase_93 | AC | 4,970 ms
10,108 KB |
testcase_94 | AC | 4,971 ms
10,004 KB |
testcase_95 | AC | 4,972 ms
9,972 KB |
testcase_96 | AC | 4,970 ms
10,096 KB |
testcase_97 | AC | 4,971 ms
10,036 KB |
testcase_98 | AC | 4,971 ms
10,124 KB |
testcase_99 | AC | 4,971 ms
10,056 KB |
testcase_100 | AC | 4,972 ms
10,068 KB |
testcase_101 | AC | 4,971 ms
10,008 KB |
testcase_102 | AC | 4,971 ms
10,056 KB |
testcase_103 | AC | 4,971 ms
10,024 KB |
testcase_104 | AC | 4,971 ms
10,012 KB |
testcase_105 | AC | 4,971 ms
10,008 KB |
testcase_106 | AC | 4,971 ms
9,960 KB |
testcase_107 | AC | 4,970 ms
9,976 KB |
testcase_108 | AC | 4,971 ms
10,160 KB |
testcase_109 | AC | 4,971 ms
10,012 KB |
testcase_110 | AC | 4,970 ms
10,168 KB |
testcase_111 | AC | 4,972 ms
10,108 KB |
testcase_112 | AC | 4,971 ms
10,028 KB |
testcase_113 | AC | 4,971 ms
10,052 KB |
testcase_114 | AC | 4,971 ms
9,960 KB |
testcase_115 | AC | 4,971 ms
10,056 KB |
testcase_116 | AC | 4,971 ms
10,012 KB |
testcase_117 | AC | 4,970 ms
10,104 KB |
testcase_118 | AC | 4,971 ms
10,024 KB |
testcase_119 | AC | 4,971 ms
9,976 KB |
ソースコード
#include <chrono> #include <cassert> #include <cstdlib> #include <vector> #include <algorithm> #include <array> #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 W[N], L[Q], R[Q]; long long Wsum[N]; long long initial_cost(int i) { return Wsum[R[i]] - (L[i] == 0 ? 0 : Wsum[L[i] - 1]); } long long adj_cost(int i, int j) { const int a = min(L[i], L[j]), b = max(L[i], L[j]), c = min(R[i], R[j]), d = max(R[i], R[j]); return (a == b ? 0 : Wsum[b - 1] - (a == 0 ? 0 : Wsum[a - 1])) + (c == d ? 0 : Wsum[d - 1] - (c == 0 ? 0 : Wsum[c - 1])); } long long calc_cost(const vector<int> &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); for (int i = 0; i < N; i++) scanf(" %d", W + i); for (int i = 0; i < Q; i++) scanf(" %d %d", L + i, R + i); Wsum[0] = W[0]; for (int i = 1; i < N; i++) Wsum[i] = Wsum[i - 1] + W[i]; } vector<int> 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); } vector<int> ans; 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.push_back(i); } long long cur_cost = calc_cost(ans); cerr << cur_cost << ' ' << score_of_cost(cur_cost) << endl; for (;;) { for (int i = 1; i < N; ++i) { if (timer.get_elapsed_time() + margin > timelimit) 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]); } 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; } } } cerr << cur_cost << ' ' << score_of_cost(cur_cost) << endl; } return ans; } int main(int argc, char **argv) { read_input(); const int B = argc <= 1 ? 1500 : atoi(argv[1]); const int S = argc <= 2 ? 300 : atoi(argv[2]); const vector<int> ans = solve(B, S); for (int i : ans) cout << i + 1 << ' '; cout << endl; }