結果

問題 No.2694 The Early Bird Catches The Worm
ユーザー deuteridayodeuteridayo
提出日時 2024-03-22 21:25:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 153 ms / 2,000 ms
コード長 5,839 bytes
コンパイル時間 5,192 ms
コンパイル使用メモリ 271,244 KB
実行使用メモリ 6,816 KB
最終ジャッジ日時 2024-09-30 10:47:47
合計ジャッジ時間 13,831 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 1 ms
5,248 KB
testcase_11 AC 1 ms
5,248 KB
testcase_12 AC 1 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 2 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 AC 2 ms
5,248 KB
testcase_21 AC 1 ms
5,248 KB
testcase_22 AC 1 ms
5,248 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 38 ms
5,248 KB
testcase_25 AC 35 ms
5,248 KB
testcase_26 AC 45 ms
5,248 KB
testcase_27 AC 60 ms
5,248 KB
testcase_28 AC 69 ms
5,248 KB
testcase_29 AC 24 ms
5,248 KB
testcase_30 AC 113 ms
6,016 KB
testcase_31 AC 63 ms
5,248 KB
testcase_32 AC 117 ms
6,016 KB
testcase_33 AC 111 ms
5,888 KB
testcase_34 AC 7 ms
5,248 KB
testcase_35 AC 59 ms
5,248 KB
testcase_36 AC 75 ms
5,248 KB
testcase_37 AC 128 ms
6,400 KB
testcase_38 AC 87 ms
5,376 KB
testcase_39 AC 21 ms
5,248 KB
testcase_40 AC 62 ms
5,248 KB
testcase_41 AC 29 ms
5,248 KB
testcase_42 AC 4 ms
5,248 KB
testcase_43 AC 11 ms
5,248 KB
testcase_44 AC 130 ms
6,272 KB
testcase_45 AC 132 ms
6,272 KB
testcase_46 AC 38 ms
5,248 KB
testcase_47 AC 40 ms
5,248 KB
testcase_48 AC 71 ms
5,248 KB
testcase_49 AC 63 ms
6,656 KB
testcase_50 AC 64 ms
6,656 KB
testcase_51 AC 62 ms
6,784 KB
testcase_52 AC 61 ms
6,784 KB
testcase_53 AC 61 ms
6,784 KB
testcase_54 AC 142 ms
6,784 KB
testcase_55 AC 153 ms
6,656 KB
testcase_56 AC 147 ms
6,656 KB
testcase_57 AC 142 ms
6,656 KB
testcase_58 AC 149 ms
6,656 KB
testcase_59 AC 143 ms
6,784 KB
testcase_60 AC 143 ms
6,784 KB
testcase_61 AC 140 ms
6,656 KB
testcase_62 AC 146 ms
6,784 KB
testcase_63 AC 145 ms
6,784 KB
testcase_64 AC 142 ms
6,656 KB
testcase_65 AC 152 ms
6,784 KB
testcase_66 AC 149 ms
6,784 KB
testcase_67 AC 142 ms
6,656 KB
testcase_68 AC 140 ms
6,784 KB
testcase_69 AC 98 ms
6,784 KB
testcase_70 AC 99 ms
6,656 KB
testcase_71 AC 101 ms
6,656 KB
testcase_72 AC 100 ms
6,816 KB
testcase_73 AC 100 ms
6,656 KB
testcase_74 AC 53 ms
5,248 KB
testcase_75 AC 97 ms
6,784 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
using llint = __int128_t;
struct edge;
using graph = vector<vector<edge>>;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
lint const mod107 = 1e9+7;
using mint107 = modint1000000007;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x) {assert(x >= 0); lint ans = sqrt(x); while(ans*ans > x)ans--; while((ans+1)*(ans+1)<=x)ans++; return ans;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= p;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
unsigned long Rand() {
  static unsigned long x=123456789, y=362436069, z=521288629, w=88675123;
  unsigned long t=(x^(x<<11));
  x=y; y=z; z=w;
  return ( w=(w^(w>>19))^(t^(t>>8)) );
}



struct Point {
    lint x, y;
    int quad;
    Point(lint X, lint Y) {
        x = X;
        y = Y;
        quad = getQuadrant();
    }
    int getQuadrant() {
        if(x >= 0) {
            if(y >= 0) return 1;
            else return 4;
        } else {
            if(y >= 0) return 2;
            else return 3;
        }
    }
};

bool operator<(const Point &left, const Point &right) {
    if(left.quad == right.quad) {
        return left.y * right.x < left.x * right.y;
    } else {
        return left.quad < right.quad;
    }
}

struct Frac {
    lint upper, lower;
    Frac() {
        Frac(0,1);
    }
    Frac(lint u, lint l) {
        assert(l != 0);
        if(u <= 0 && l < 0) {
            upper = -u;
            lower = -l;
        } else {
            upper = u;
            lower = l;
        }
        reduction();
    }

    Frac(lint u) {
        upper = u;
        lower = 1;
    } 

    void reduction() {
        if(upper != 0) {
            lint g = gcd(abs(upper), abs(lower));
            upper /= g;
            lower /= g;
        
            if(lower < 0) {
                lower *= -1;
                upper *= -1;
            }
        } else {
            lower = 1;
        }
    }

    Frac operator+(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper*other.lower + lower*other.upper;
        return Frac(U, L);
    }

    Frac operator-(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper*other.lower - lower*other.upper;
        upper = U;
        lower = L;
        return Frac(U, L);
    }

    bool operator<=(const Frac &other) {
        return upper*other.lower <= lower*other.upper;
    }

    Frac operator*(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper * other.upper;
        return Frac(U, L);
    }

    Frac operator/(const Frac &other) {
        assert(other.upper != 0);
        lint L = lower * other.upper;
        lint U = upper * other.lower;
        return Frac(U, L);
    }
};

bool operator<(const Frac &left, const Frac &right) {
    return left.upper*right.lower < left.lower*right.upper;
}
lint extGCD(lint a, lint b, lint &x, lint &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    lint d = extGCD(b, a%b, y, x);
    y -= a/b * x;
    return d;
}

struct edge{
    int to;
    int cost;
};

vector<lint>dijkstra(int s, graph &g) {
    vec<lint>ret(g.size(), INF64);
    priority_queue<pair<lint, lint>>que;
    que.push({-0, s});
    ret[s] = 0;
    while(!que.empty()) {
        auto q = que.top();
        que.pop();
        for(auto e: g[q.second]) {
            if(ret[e.to] > -q.first + e.cost) {
                ret[e.to] = -q.first + e.cost;
                que.push({-ret[e.to], e.to});
            }
        }
    }
    return ret;
}
int main(){
    lint n,h;
    cin >> n >> h;
    lint a[n], b[n];
    rep(i, n) {
        cin >> a[i];
    }
    rep(i, n ) {
        cin >> b[i];
    }
    lint ans = 0;
    lint S = 0;
    lint T = 0;
    lint SS = 0;
    int r = 0;
    rep(i, n) {
        while( r < n && S + b[r]*(r-i+1) <= h) {
            S += b[r]*(r-i+1);
            T += a[r];
            SS += b[r];
            r++;
        }
        ans = max(ans, T);
        T -= a[i];
        S -= SS;
        SS -= b[i];
    }
    cout << ans << endl;
}
0