제출 #1267761

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267761		gustavo_d	Self Study (JOI22_ho_t2)	C++20	62 / 100	125 ms	5132 KiB

Main

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

typedef long long ll;

const int MAXN = 3e5;
const ll INF = 1e18;

ll a[MAXN], b[MAXN];

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

    int n; ll days; cin >> n >> days;
    for (int i=0; i<n; i++) cin >> a[i];
    for (int i=0; i<n; i++) cin >> b[i];

    ll l = 0, r = 1000000000LL * days; ll ans = 0;
    while (l <= r) {
        ll mid = (l + r) / 2;

        ll available = 0, needed = 0;
        for (int i=0; i<n; i++) {
            ll val = max(a[i], b[i]);
            ll need = (mid + val - 1) / val;
            if (need <= days) available += days - need;
            else needed += (mid - days * val + b[i] - 1) / b[i];
        }

        if (available >= needed) {
            ans = mid;
            l = mid+1;
        } else r = mid-1;
    }
    cout << ans << '\n';

    return 0;
}

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