제출 #824341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
824341		peteza	Self Study (JOI22_ho_t2)	C++14	100 / 100	342 ms	5024 KiB

Main

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

ll n, m;
ll l=0, r=1e18, 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;
        double 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);
        }
        if(tfree >= treq) l = mid + 1;
        else r = mid - 1;
    }
    cout << r;
}

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