제출 #1160898

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1160898		thinknoexit	Self Study (JOI22_ho_t2)	C++20	100 / 100	87 ms	4936 KiB

Main

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[300300], b[300300];
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    ll m;
    cin >> n >> m;
    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 = 2e18;
    while (l < r) {
        ll mid = l + (r - l + 1) / 2;
        ll now = 0;
        for (int i = 1;i <= n;i++) {
            if (a[i] * m >= mid) {
                now += m - (mid + a[i] - 1) / a[i];
            }
            else {
                now -= ((mid - a[i] * m) + b[i] - 1) / b[i];
            }
            if (now + n * m < 0) break;
        }
        if (now >= 0) l = mid;
        else r = mid - 1;
    }
    cout << l << '\n';
    return 0;
}

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