제출 #1028953

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1028953		tvladm2009	Self Study (JOI22_ho_t2)	C++17	100 / 100	203 ms	11536 KiB

Main

#include <bits/stdc++.h>
 
using namespace std;
#define int long long
 
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> 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 l = 1, r = 1e18 * 1e9, sol = 0;
    while (l <= r) {
        __int128 mid = (l + r) / 2;
        __int128 days = 0;
        __int128 need = 0;
        for (int i = 1; i <= n; ++i) {
            if ((__int128) a[i] * m >= mid) {
                days += (__int128) m - (mid + a[i] - 1) / a[i];
            } else {
                need += (__int128) (mid - (__int128) a[i] * m + b[i] - 1) / (__int128) b[i];
            }
        }
        if (need <= days) {
            sol = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    if (sol == 0) {
        cout << 0;
        return 0;
    }
    vector<int> d;
    while (sol > 0) {
        d.push_back(sol % 10);
        sol /= 10;
    }
    reverse(d.begin(), d.end());
    for (auto i : d) cout << i;
    return 0;
}

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