結果
問題 | No.2694 The Early Bird Catches The Worm |
ユーザー | Misuki |
提出日時 | 2024-03-22 21:40:39 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 52 ms / 2,000 ms |
コード長 | 3,445 bytes |
コンパイル時間 | 2,710 ms |
コンパイル使用メモリ | 199,208 KB |
実行使用メモリ | 9,600 KB |
最終ジャッジ日時 | 2024-03-22 21:40:47 |
合計ジャッジ時間 | 7,814 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 3 ms
6,676 KB |
testcase_06 | AC | 2 ms
6,676 KB |
testcase_07 | AC | 2 ms
6,676 KB |
testcase_08 | AC | 2 ms
6,676 KB |
testcase_09 | AC | 3 ms
6,676 KB |
testcase_10 | AC | 2 ms
6,676 KB |
testcase_11 | AC | 4 ms
6,676 KB |
testcase_12 | AC | 4 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 | 3 ms
6,676 KB |
testcase_18 | AC | 2 ms
6,676 KB |
testcase_19 | AC | 2 ms
6,676 KB |
testcase_20 | AC | 3 ms
6,676 KB |
testcase_21 | AC | 2 ms
6,676 KB |
testcase_22 | AC | 3 ms
6,676 KB |
testcase_23 | AC | 2 ms
6,676 KB |
testcase_24 | AC | 15 ms
6,676 KB |
testcase_25 | AC | 14 ms
6,676 KB |
testcase_26 | AC | 18 ms
6,676 KB |
testcase_27 | AC | 24 ms
6,676 KB |
testcase_28 | AC | 26 ms
6,676 KB |
testcase_29 | AC | 10 ms
6,676 KB |
testcase_30 | AC | 42 ms
8,192 KB |
testcase_31 | AC | 23 ms
6,676 KB |
testcase_32 | AC | 44 ms
8,448 KB |
testcase_33 | AC | 41 ms
8,320 KB |
testcase_34 | AC | 4 ms
6,676 KB |
testcase_35 | AC | 22 ms
6,676 KB |
testcase_36 | AC | 27 ms
6,676 KB |
testcase_37 | AC | 46 ms
8,960 KB |
testcase_38 | AC | 32 ms
7,040 KB |
testcase_39 | AC | 8 ms
6,676 KB |
testcase_40 | AC | 23 ms
6,676 KB |
testcase_41 | AC | 12 ms
6,676 KB |
testcase_42 | AC | 2 ms
6,676 KB |
testcase_43 | AC | 5 ms
6,676 KB |
testcase_44 | AC | 46 ms
8,960 KB |
testcase_45 | AC | 46 ms
8,960 KB |
testcase_46 | AC | 15 ms
6,676 KB |
testcase_47 | AC | 16 ms
6,676 KB |
testcase_48 | AC | 26 ms
6,676 KB |
testcase_49 | AC | 34 ms
9,600 KB |
testcase_50 | AC | 33 ms
9,600 KB |
testcase_51 | AC | 33 ms
9,600 KB |
testcase_52 | AC | 34 ms
9,600 KB |
testcase_53 | AC | 33 ms
9,600 KB |
testcase_54 | AC | 52 ms
9,600 KB |
testcase_55 | AC | 52 ms
9,600 KB |
testcase_56 | AC | 52 ms
9,600 KB |
testcase_57 | AC | 51 ms
9,600 KB |
testcase_58 | AC | 51 ms
9,600 KB |
testcase_59 | AC | 51 ms
9,600 KB |
testcase_60 | AC | 52 ms
9,600 KB |
testcase_61 | AC | 51 ms
9,600 KB |
testcase_62 | AC | 52 ms
9,600 KB |
testcase_63 | AC | 52 ms
9,600 KB |
testcase_64 | AC | 51 ms
9,600 KB |
testcase_65 | AC | 52 ms
9,600 KB |
testcase_66 | AC | 51 ms
9,600 KB |
testcase_67 | AC | 52 ms
9,600 KB |
testcase_68 | AC | 51 ms
9,600 KB |
testcase_69 | AC | 39 ms
9,600 KB |
testcase_70 | AC | 39 ms
9,600 KB |
testcase_71 | AC | 40 ms
9,600 KB |
testcase_72 | AC | 40 ms
9,600 KB |
testcase_73 | AC | 40 ms
9,600 KB |
testcase_74 | AC | 21 ms
6,676 KB |
testcase_75 | AC | 39 ms
9,600 KB |
ソースコード
#pragma GCC optimize("O2") #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cctype> #include <cfenv> #include <cfloat> #include <chrono> #include <cinttypes> #include <climits> #include <cmath> #include <complex> #include <cstdarg> #include <cstddef> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <deque> #include <fstream> #include <functional> #include <initializer_list> #include <iomanip> #include <ios> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <streambuf> #include <string> #include <tuple> #include <type_traits> #include <variant> #if __cplusplus >= 202002L #include <bit> #include <compare> #include <concepts> #include <numbers> #include <ranges> #include <span> #else #define ssize(v) (int)(v).size() #define popcount(x) __builtin_popcountll(x) constexpr int bit_width(const unsigned int x) { return x == 0 ? 0 : ((sizeof(unsigned int) * CHAR_BIT) - __builtin_clz(x)); } constexpr int bit_width(const unsigned long long x) { return x == 0 ? 0 : ((sizeof(unsigned long long) * CHAR_BIT) - __builtin_clzll(x)); } constexpr int countr_zero(const unsigned int x) { return x == 0 ? sizeof(unsigned int) * CHAR_BIT : __builtin_ctz(x); } constexpr int countr_zero(const unsigned long long x) { return x == 0 ? sizeof(unsigned long long) * CHAR_BIT : __builtin_ctzll(x); } constexpr unsigned int bit_ceil(const unsigned int x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1u << bit_width(x))); } constexpr unsigned long long bit_ceil(const unsigned long long x) { return x == 0 ? 1 : (popcount(x) == 1 ? x : (1ull << bit_width(x))); } #endif #define int ll #define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1) #define INT128_MIN (-INT128_MAX - 1) #define clock chrono::steady_clock::now().time_since_epoch().count() #ifdef DEBUG #define dbg(x) cout << (#x) << " = " << x << '\n' #else #define dbg(x) #endif using namespace std; using ll = long long; using ull = unsigned long long; using ldb = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; //#define double ldb template<class T> ostream& operator<<(ostream& os, const pair<T, T> pr) { return os << pr.first << ' ' << pr.second; } template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N> &arr) { for(const T &X : arr) os << X << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const vector<T> &vec) { for(const T &X : vec) os << X << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const set<T> &s) { for(const T &x : s) os << x << ' '; return os; } signed main() { ios::sync_with_stdio(false), cin.tie(NULL); int n, h; cin >> n >> h; vector<int> a(n), b(n); for(int &x : a) cin >> x; for(int &x : b) cin >> x; vector<int> as(n + 1), bs(n + 1); for(int i = n - 1; i >= 0; i--) as[i] = as[i + 1] + a[i], bs[i] = bs[i + 1] + b[i]; int ans = 0; for(int l = n - 1, r = n - 1, sum = 0; l >= 0; l--) { sum += bs[l] - bs[r + 1]; while(sum > h) { sum -= (r - l + 1) * b[r]; r--; } ans = max(ans, as[l] - as[r + 1]); } cout << ans << '\n'; return 0; }