Submission #966973

#	Time	Username	Problem	Language	Result	Execution time	Memory
966973		Tzepu100	Self Study (JOI22_ho_t2)	C++14	100 / 100	198 ms	11616 KiB

Main

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N, M;
    cin >> N >> M;
    vector<ll> A(N), B(N);
    for(ll& a : A) {
        cin >> a;
    }
    for(ll& b : B){
        cin >> b;
    }
    for(ll i = 0; i < N; i++){
        A[i] = max(A[i], B[i]);
    }

    ll ok = 0, ng = 1LL << 60;
    auto check = [&](ll x) -> bool {
        ll day = 0;
        for(ll i = 0; i < N; i++){
            if(x <= A[i] * M) day += (x + A[i] - 1) / A[i];
            else day += M + (x - A[i] * M + B[i] - 1) / B[i];
            if(day > N * M) return 0;
        }
        return 1;
    };
    while(ng - ok > 1){
        const ll mid = (ng + ok) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29
• Subtask 5: 9 / 9