제출 #1030877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030877		VMaksimoski008	Self Study (JOI22_ho_t2)	C++17	100 / 100	252 ms	11348 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ll n, m;
    cin >> n >> m;

    vector<ll> a(n+1), b(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]);

    __int128_t l=1, r=1e18, ans=0;
    while(l <= r) {
        __int128_t mid = (l + r) / 2;
        ll total = 0;

        for(int i=1; i<=n; i++) {
            if(a[i] * m >= mid) total += (mid + a[i] - 1) / a[i];
            else total += (mid - a[i] * m + b[i] - 1) / b[i] + m;

            if(total > n * m) {
                total = n * m + 1;
                break;
            }
        }

        if(total <= n * m) ans = mid, l = mid + 1;
        else r = mid - 1;
    }

    cout << (ll)ans << '\n';
    return 0;
}

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