結果
問題 | No.2694 The Early Bird Catches The Worm |
ユーザー |
![]() |
提出日時 | 2024-03-22 21:48:34 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 62 ms / 2,000 ms |
コード長 | 2,642 bytes |
コンパイル時間 | 3,842 ms |
コンパイル使用メモリ | 263,592 KB |
実行使用メモリ | 13,960 KB |
最終ジャッジ日時 | 2024-09-30 11:17:08 |
合計ジャッジ時間 | 8,460 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 72 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using int64 = long long;const int64 infll = (1LL << 62) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename F >struct FixPoint : F {explicit FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint<F>{forward<F>(f)};}int main() {int N, H;cin >> N >> H;vector< int64 > A(N), B(N);cin >> A >> B;vector< int64 > S(N + 1);for(int i = 0; i < N; i++) {S[i + 1] = S[i] + A[i];}vector< int64 > T(N + 1), U(N + 1);for(int i = 0; i < N; i++) {T[i + 1] = T[i] + B[i] * (i + 1);U[i + 1] = U[i] + B[i];}B.insert(B.begin(), 0);int64 ret = 0;for(int L = 0; L < N; L++) {int64 ok = L, ng = N + 1;while(ng - ok > 1) {int64 mid = (ok + ng) / 2;if(T[mid] - T[L] - (U[mid] - U[L]) * L <= H) ok = mid;else ng = mid;}chmax(ret, S[ok] - S[L]);}cout << ret << endl;}