結果
問題 | No.738 平らな農地 |
ユーザー | risujiroh |
提出日時 | 2019-04-29 00:58:37 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 440 ms / 2,000 ms |
コード長 | 4,631 bytes |
コンパイル時間 | 2,264 ms |
コンパイル使用メモリ | 182,464 KB |
実行使用メモリ | 29,972 KB |
最終ジャッジ日時 | 2023-08-23 12:56:53 |
合計ジャッジ時間 | 21,176 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 8 ms
4,380 KB |
testcase_06 | AC | 9 ms
4,380 KB |
testcase_07 | AC | 7 ms
4,380 KB |
testcase_08 | AC | 4 ms
4,376 KB |
testcase_09 | AC | 3 ms
4,380 KB |
testcase_10 | AC | 3 ms
4,380 KB |
testcase_11 | AC | 4 ms
4,380 KB |
testcase_12 | AC | 3 ms
4,376 KB |
testcase_13 | AC | 7 ms
4,380 KB |
testcase_14 | AC | 4 ms
4,380 KB |
testcase_15 | AC | 227 ms
27,524 KB |
testcase_16 | AC | 230 ms
28,076 KB |
testcase_17 | AC | 264 ms
27,788 KB |
testcase_18 | AC | 256 ms
27,120 KB |
testcase_19 | AC | 309 ms
29,444 KB |
testcase_20 | AC | 235 ms
28,036 KB |
testcase_21 | AC | 293 ms
29,364 KB |
testcase_22 | AC | 241 ms
28,000 KB |
testcase_23 | AC | 282 ms
28,604 KB |
testcase_24 | AC | 283 ms
28,164 KB |
testcase_25 | AC | 3 ms
4,376 KB |
testcase_26 | AC | 4 ms
4,380 KB |
testcase_27 | AC | 3 ms
4,376 KB |
testcase_28 | AC | 3 ms
4,376 KB |
testcase_29 | AC | 3 ms
4,380 KB |
testcase_30 | AC | 4 ms
4,376 KB |
testcase_31 | AC | 3 ms
4,380 KB |
testcase_32 | AC | 4 ms
4,376 KB |
testcase_33 | AC | 3 ms
4,380 KB |
testcase_34 | AC | 4 ms
4,376 KB |
testcase_35 | AC | 3 ms
4,376 KB |
testcase_36 | AC | 3 ms
4,380 KB |
testcase_37 | AC | 3 ms
4,376 KB |
testcase_38 | AC | 3 ms
4,380 KB |
testcase_39 | AC | 3 ms
4,376 KB |
testcase_40 | AC | 3 ms
4,376 KB |
testcase_41 | AC | 3 ms
4,380 KB |
testcase_42 | AC | 3 ms
4,380 KB |
testcase_43 | AC | 3 ms
4,376 KB |
testcase_44 | AC | 4 ms
4,376 KB |
testcase_45 | AC | 227 ms
29,904 KB |
testcase_46 | AC | 223 ms
27,656 KB |
testcase_47 | AC | 226 ms
29,128 KB |
testcase_48 | AC | 201 ms
28,132 KB |
testcase_49 | AC | 197 ms
27,808 KB |
testcase_50 | AC | 201 ms
28,864 KB |
testcase_51 | AC | 235 ms
28,992 KB |
testcase_52 | AC | 214 ms
27,792 KB |
testcase_53 | AC | 221 ms
28,300 KB |
testcase_54 | AC | 232 ms
29,348 KB |
testcase_55 | AC | 238 ms
29,000 KB |
testcase_56 | AC | 230 ms
28,796 KB |
testcase_57 | AC | 212 ms
27,420 KB |
testcase_58 | AC | 219 ms
28,540 KB |
testcase_59 | AC | 221 ms
29,960 KB |
testcase_60 | AC | 212 ms
29,680 KB |
testcase_61 | AC | 214 ms
29,360 KB |
testcase_62 | AC | 206 ms
27,432 KB |
testcase_63 | AC | 244 ms
29,972 KB |
testcase_64 | AC | 227 ms
29,316 KB |
testcase_65 | AC | 370 ms
27,892 KB |
testcase_66 | AC | 392 ms
28,732 KB |
testcase_67 | AC | 262 ms
27,436 KB |
testcase_68 | AC | 260 ms
28,336 KB |
testcase_69 | AC | 386 ms
28,856 KB |
testcase_70 | AC | 312 ms
29,752 KB |
testcase_71 | AC | 16 ms
5,684 KB |
testcase_72 | AC | 201 ms
27,596 KB |
testcase_73 | AC | 180 ms
25,848 KB |
testcase_74 | AC | 248 ms
28,724 KB |
testcase_75 | AC | 354 ms
27,488 KB |
testcase_76 | AC | 280 ms
28,276 KB |
testcase_77 | AC | 397 ms
27,448 KB |
testcase_78 | AC | 436 ms
29,648 KB |
testcase_79 | AC | 431 ms
29,544 KB |
testcase_80 | AC | 317 ms
28,724 KB |
testcase_81 | AC | 377 ms
27,792 KB |
testcase_82 | AC | 357 ms
28,856 KB |
testcase_83 | AC | 229 ms
29,956 KB |
testcase_84 | AC | 209 ms
29,236 KB |
testcase_85 | AC | 440 ms
29,824 KB |
testcase_86 | AC | 387 ms
27,420 KB |
testcase_87 | AC | 142 ms
28,452 KB |
testcase_88 | AC | 128 ms
27,328 KB |
testcase_89 | AC | 1 ms
4,376 KB |
testcase_90 | AC | 1 ms
4,376 KB |
testcase_91 | AC | 2 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; template<class T = int> using V = vector<T>; template<class T = int> using VV = V< V<T> >; #pragma GCC target ("avx") struct Bitvector { using T = uint32_t; static constexpr int W = 32; static int popcnt(T x) { return __builtin_popcount(x); } const int n; V<T> b; V<> c; Bitvector(int n) : n(n), b(n / W + 1), c(n / W + 1) {} void set(int i) { b[i / W] |= (T)1 << i % W; } void build() { for (int i = 0; i < n / W; ++i) c[i + 1] = c[i] + popcnt(b[i]); } bool operator[](int i) const { return b[i / W] >> i % W & 1; } int rank(int i) const { return c[i / W] + popcnt(b[i / W] & ~(~(T)0 << i % W)); } int rank(bool v, int i) const { return v ? rank(i) : i - rank(i); } }; template<class T> struct WaveletMatrix { const int n, h; V<Bitvector> b; V<> z; template<class Itr> WaveletMatrix(Itr first, Itr last) : n(distance(first, last)), h(__lg(2 * *max_element(first, last) + 1)), b(h, Bitvector(n)), z(h) { assert(*min_element(first, last) >= 0); V<T> a(first, last), na(n); for (int j = 0; j < h; ++j) { for (int i = 0; i < n; ++i) { if (a[i] >> h + ~j & 1) b[j].set(i); else ++z[j]; } b[j].build(); int p = 0, q = z[j]; for (int i = 0; i < n; ++i) (b[j][i] ? na[q++] : na[p++]) = a[i]; swap(a, na); } } T operator[](int i) const { T res = 0; for (int j = 0; j < h; ++j) { T v = b[j][i]; res |= v << h + ~j; i = v * z[j] + b[j].rank(v, i); } return res; } int rank(int l, int r, T x) const { if (x < 0 or x >= (T)1 << h) return 0; for (int j = 0; j < h; ++j) { int v = x >> h + ~j & 1; l = v * z[j] + b[j].rank(v, l); r = v * z[j] + b[j].rank(v, r); } return r - l; } T kth(int l, int r, int k) const { assert(0 <= k and k < r - l); T res = 0; for (int j = 0; j < h; ++j) { int p = b[j].rank(0, l), q = b[j].rank(0, r); T v = k >= q - p; k -= v * (q - p); res |= v << h + ~j; l = v * z[j] + (v ? l - p : p); r = v * z[j] + (v ? r - q : q); } return res; } T rkth(int l, int r, int k) const { return kth(l, r, r - l + ~k); } int cnt(int l, int r, T x) const { if ((x = max<T>(x, 0)) >= (T)1 << h) return 0; int res = 0; for (int j = 0; j < h; ++j) { int p = b[j].rank(1, l), q = b[j].rank(1, r); int v = x >> h + ~j & 1; res += !v * (q - p); l = v * z[j] + (v ? p : l - p); r = v * z[j] + (v ? q : r - q); } return res + r - l; } int cnt(int l, int r, T x, T y) const { return cnt(l, r, x) - cnt(l, r, y); } }; struct WaveletSum { using T = lint; const int n, h; V<Bitvector> b; V<> z; VV<T> c; template<class Itr> WaveletSum(Itr first, Itr last) : n(distance(first, last)), h(__lg(2 * *max_element(first, last) + 1)), b(h, Bitvector(n)), z(h), c(h + 1, V<T>(n + 1)) { assert(*min_element(first, last) >= 0); V<> w(first, last), nw(n); for (int j = 0; j < h; ++j) { for (int i = 0; i < n; ++i) { if (w[i] >> h + ~j & 1) b[j].set(i); else ++z[j]; } b[j].build(); int p = 0, q = z[j]; for (int i = 0; i < n; ++i) (b[j][i] ? nw[q++] : nw[p++]) = w[i]; swap(w, nw); } } T acc(int l, int r, int x, int y, int j, int s, int t) const { if (y <= s or t <= x) return 0; if (x <= s and t <= y) return c[j][r] - c[j][l]; int m = s + t >> 1, p = b[j].rank(0, l), q = b[j].rank(0, r); return acc(p, q, x, y, j + 1, s, m) + acc(z[j] + l - p, z[j] + r - q, x, y, j + 1, m, t); } T acc(int l, int r, int x, int y) const { return acc(l, r, x, y, 0, 0, 1 << h); } void set(int i, T x) { for (int j = 0; j < h; ++j) { c[j][i + 1] = x; int v = b[j][i]; i = v * z[j] + b[j].rank(v, i); } c[h][i + 1] = x; } void build() { for (int j = 0; j <= h; ++j) { for (int i = 0; i < n; ++i) c[j][i + 1] += c[j][i]; } } }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n, k; cin >> n >> k; V<> a(n); for (auto&& e : a) cin >> e; WaveletMatrix<int> wm(begin(a), end(a)); WaveletSum ws(begin(a), end(a)); for (int i = 0; i < n; ++i) { ws.set(i, a[i]); } ws.build(); lint res = 9e18; for (int l = 0; l + k <= n; ++l) { int r = l + k; lint m = wm.kth(l, r, k / 2); int cl = wm.cnt(l, r, 0, m), cu = wm.cnt(l, r, m, 1 << 30); lint curr = 0; curr += cl * m - ws.acc(l, r, 0, m); curr += ws.acc(l, r, m, 1 << 30) - cu * m; res = min(res, curr); } cout << res << '\n'; }