Submission #529433

#TimeUsernameProblemLanguageResultExecution timeMemory
529433wiwihoSelf Study (JOI22_ho_t2)C++14
100 / 100
363 ms15044 KiB
#include <bits/stdc++.h>

#define iter(a) a.begin(), a.end()

using namespace std;

typedef __int128 ll;

ll iceil(ll a, ll b){
    return (a + b - 1) / b;
}

int n;
ll m;
vector<ll> a, b;

ll tans;

istream& operator>>(istream& i, __int128& a){
    long long t;
    i >> t;
    a = t;
    return i;
}

ostream& operator<<(ostream& o, __int128 a){
    long long t = a;
    return o << t;
}

bool check(ll mn){
    ll cnt = 0;
    for(int i = 1; i <= n; i++){
        ll need = iceil(mn, a[i]);
        if(need <= m){
            cnt += m - need;
            continue;
        }
        ll tmp = mn - m * a[i];
        cnt -= iceil(tmp, b[i]);
    }

    return cnt >= 0;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m;
    a.resize(n + 1);
    b.resize(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) cin >> b[i];
    
    for(int i = 1; i <= n; i++) a[i] = max(a[i], b[i]);

    ll l = 0, r = 1LL << 60;
    while(l < r){
        ll mid = (l + r + 1) / 2;
        if(check(mid)) l = mid;
        else r = mid - 1;
    }


    cout << l << "\n";

    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...