제출 #734407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
734407		Josia	Self Study (JOI22_ho_t2)	C++17	0 / 100	542 ms	5068 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define int int64_t

int n, m;

bool check(int pos, vector<int>&a, vector<int>&b) {
    int free = 0;
    int req = 0;

    for (int i=0; i<n; i++) {
        int thisNeedsFromA = (pos+a[i]-1)/a[i];

        if (thisNeedsFromA <= m) {
            free += m-thisNeedsFromA;
        }
        else {
            req += (pos-a[i]*m + b[i]-1)/b[i];
        }
    }

    return free >= req;
}



signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    cin >> n >> m;

    vector<int> a(n), b(n);

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

    for (int i = 0; i<n; i++) a[i] = max(a[i], b[i]);



    int l = 0, r = INT64_MAX;

    while (l < r) {
        int pos = (l + r + 1) / 2;

        if (check(pos, a, b)) {
            l = pos;
        } else {
            r = pos-1;
        }
    }


    cout << l << "\n";


    return 0;
}

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