Submission #824339

#	Time	Username	Problem	Language	Result	Execution time	Memory
824339		peteza	Self Study (JOI22_ho_t2)	C++14	0 / 100	453 ms	10788 KiB

Main

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

ll n, m;
ll l=0, r=3e18, mid;
ll a[300005], b[300005];

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cin >> n >> m;
    for(int i=0;i<n;i++) cin >> a[i];
    for(int i=0;i<n;i++) {
        cin >> b[i];
        a[i] = max(a[i], b[i]);
    }
    while(l <= r) {
        mid = (l+r) >> 1;
        ll treq=0, tfree=0;
        for(int i=0;i<n;i++) {
            ll times = (mid+a[i]-1)/a[i];
            if(times > m) treq += (mid-m*a[i]+b[i]-1)/b[i];
            else tfree += (m-times);
        }
        //cout << tfree << ' ' << treq << '\n';
        if(tfree >= treq) l = mid + 1;
        else r = mid - 1;
    }
    cout << r;
}

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