結果
問題 | No.2694 The Early Bird Catches The Worm |
ユーザー | Today03 |
提出日時 | 2024-03-22 21:54:17 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,675 ms / 2,000 ms |
コード長 | 3,151 bytes |
コンパイル時間 | 2,400 ms |
コンパイル使用メモリ | 213,328 KB |
実行使用メモリ | 18,716 KB |
最終ジャッジ日時 | 2024-03-22 21:55:07 |
合計ジャッジ時間 | 45,805 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 2 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 2 ms
6,676 KB |
testcase_06 | AC | 4 ms
6,676 KB |
testcase_07 | AC | 2 ms
6,676 KB |
testcase_08 | AC | 3 ms
6,676 KB |
testcase_09 | AC | 3 ms
6,676 KB |
testcase_10 | AC | 2 ms
6,676 KB |
testcase_11 | AC | 2 ms
6,676 KB |
testcase_12 | AC | 2 ms
6,676 KB |
testcase_13 | AC | 2 ms
6,676 KB |
testcase_14 | AC | 3 ms
6,676 KB |
testcase_15 | AC | 3 ms
6,676 KB |
testcase_16 | AC | 3 ms
6,676 KB |
testcase_17 | AC | 2 ms
6,676 KB |
testcase_18 | AC | 4 ms
6,676 KB |
testcase_19 | AC | 2 ms
6,676 KB |
testcase_20 | AC | 2 ms
6,676 KB |
testcase_21 | AC | 2 ms
6,676 KB |
testcase_22 | AC | 2 ms
6,676 KB |
testcase_23 | AC | 3 ms
6,676 KB |
testcase_24 | AC | 281 ms
7,196 KB |
testcase_25 | AC | 144 ms
7,100 KB |
testcase_26 | AC | 316 ms
7,324 KB |
testcase_27 | AC | 509 ms
10,780 KB |
testcase_28 | AC | 266 ms
10,956 KB |
testcase_29 | AC | 44 ms
6,676 KB |
testcase_30 | AC | 502 ms
18,012 KB |
testcase_31 | AC | 295 ms
10,796 KB |
testcase_32 | AC | 1,104 ms
18,124 KB |
testcase_33 | AC | 844 ms
18,060 KB |
testcase_34 | AC | 21 ms
6,676 KB |
testcase_35 | AC | 265 ms
10,684 KB |
testcase_36 | AC | 561 ms
11,052 KB |
testcase_37 | AC | 920 ms
18,380 KB |
testcase_38 | AC | 342 ms
11,276 KB |
testcase_39 | AC | 47 ms
6,676 KB |
testcase_40 | AC | 256 ms
10,796 KB |
testcase_41 | AC | 118 ms
7,040 KB |
testcase_42 | AC | 6 ms
6,676 KB |
testcase_43 | AC | 38 ms
6,676 KB |
testcase_44 | AC | 524 ms
18,396 KB |
testcase_45 | AC | 205 ms
18,396 KB |
testcase_46 | AC | 213 ms
7,180 KB |
testcase_47 | AC | 82 ms
7,244 KB |
testcase_48 | AC | 507 ms
10,956 KB |
testcase_49 | AC | 1,524 ms
18,716 KB |
testcase_50 | AC | 1,560 ms
18,716 KB |
testcase_51 | AC | 1,545 ms
18,716 KB |
testcase_52 | AC | 1,563 ms
18,716 KB |
testcase_53 | AC | 1,544 ms
18,716 KB |
testcase_54 | AC | 934 ms
18,716 KB |
testcase_55 | AC | 934 ms
18,716 KB |
testcase_56 | AC | 787 ms
18,716 KB |
testcase_57 | AC | 1,373 ms
18,716 KB |
testcase_58 | AC | 457 ms
18,716 KB |
testcase_59 | AC | 1,159 ms
18,716 KB |
testcase_60 | AC | 1,107 ms
18,716 KB |
testcase_61 | AC | 1,221 ms
18,716 KB |
testcase_62 | AC | 1,265 ms
18,716 KB |
testcase_63 | AC | 1,073 ms
18,716 KB |
testcase_64 | AC | 388 ms
18,716 KB |
testcase_65 | AC | 1,043 ms
18,716 KB |
testcase_66 | AC | 909 ms
18,716 KB |
testcase_67 | AC | 481 ms
18,716 KB |
testcase_68 | AC | 387 ms
18,716 KB |
testcase_69 | AC | 1,675 ms
18,716 KB |
testcase_70 | AC | 1,668 ms
18,716 KB |
testcase_71 | AC | 1,629 ms
18,716 KB |
testcase_72 | AC | 1,606 ms
18,716 KB |
testcase_73 | AC | 1,626 ms
18,716 KB |
testcase_74 | AC | 724 ms
11,004 KB |
testcase_75 | AC | 1,649 ms
18,716 KB |
ソースコード
#include <bits/stdc++.h> #ifdef LOCAL #include "./debug.cpp" #else #define debug(...) #define print_line #endif using namespace std; using ll = long long; template <typename T> struct segment_tree { using F = function<T(T, T)>; segment_tree(int n, F f, T e) { this->n = 1; while (this->n < n) { this->n *= 2; } this->size = n; this->f = f; this->e = e; dat = vector<T>(this->n * 2 - 1, e); } void build(const vector<T> &a) { for (int i = 0; i < (int)a.size(); i++) { dat[i + n - 1] = a[i]; } for (int i = n - 2; i >= 0; i--) { dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]); } } void set(int i, T x) { i += n - 1; dat[i] = x; while (i > 0) { i = (i - 1) / 2; dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]); } } T query(int l, int r) { return query(l, r, 0, 0, n); } T operator[](int i) { return dat[n - 1 + i]; } int size; private: int n; vector<T> dat; F f; T e; T query(int left, int right, int i, int l, int r) { if (r <= left || right <= l) { return e; } else if (left <= l && r <= right) { return dat[i]; } else { int mid = (l + r) / 2; return f(query(left, right, i * 2 + 1, l, mid), query(left, right, i * 2 + 2, mid, r)); } } }; template <typename T> segment_tree<T> range_min_query(int n, T e = numeric_limits<T>::max()) { auto f = [](T a, T b) { return min(a, b); }; return segment_tree<T>(n, f, e); } template <typename T> segment_tree<T> range_max_query(int n, T e = numeric_limits<T>::min()) { auto f = [](T a, T b) { return max(a, b); }; return segment_tree<T>(n, f, e); } template <typename T> segment_tree<T> range_sum_query(int n, T e = 0) { auto f = [](T a, T b) { return a + b; }; return segment_tree<T>(n, f, e); } struct S { ll val, len, base; }; S f(S a, S b) { S ret; ret.val = a.val + a.len * b.base + b.val; ret.len = a.len + b.len; ret.base = a.base + b.base; return ret; } S fe = S{0, 0, 0}; int main() { int N; ll H; cin >> N >> H; vector<int> A(N); for (int i = 0; i < N; i++) { cin >> A[i]; } vector<int> B(N); for (int i = 0; i < N; i++) { cin >> B[i]; } segment_tree<S> seg(N, f, fe); for (int i = 0; i < N; i++) { seg.set(i, S{B[i], 1, B[i]}); } vector<ll> pref(N + 1); for (int i = 0; i < N; i++) { pref[i + 1] = pref[i] + A[i]; } ll ans = 0; for (int i = 0; i < N; i++) { if (B[i] > H) { continue; } int lo = i, hi = N; while (hi - lo > 1) { int mid = (lo + hi) / 2; ll sumb = seg.query(i, mid + 1).val; if (sumb <= H) { lo = mid; } else { hi = mid; } } ans = max(ans, pref[lo + 1] - pref[i]); } cout << ans << endl; }