Submission #1183807

#TimeUsernameProblemLanguageResultExecution timeMemory
1183807apelpisiaSelf Study (JOI22_ho_t2)C++20
62 / 100
1070 ms5136 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll nx = 3e5+5;
ll n, m, a[nx], b[nx], l = 0, r = 1e18, md;

bool check(){
    ll cnt = 0;
    for(ll i=0; i<n; i++){
        ll amt = 0;
        while(amt<md){
            if(a[i]>b[i] && amt<a[i]*m){
                amt+=a[i];
                cnt++;
            } else{
                amt+=b[i];
                cnt++;
            }
            if(cnt>n*m) return false;
        }
    }
    return true;
}

int main(){
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n >> m;
    for(ll i=0; i<n; i++) cin >> a[i];
    for(ll i=0; i<n; i++) cin >> b[i];
    while(l<r){
        md = l+(r-l)/2;
        if(check()) l = md+1;
        else r = md;
    }
    cout << l-1;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...