제출 #538665

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

Main

#include <bits/stdc++.h>
#define pii pair<int, int>
#define ll long long
#define ld long double

using namespace std;

vector<ll> a;
vector<ll> b;
int n; ll m;
bool binary(ll x) {
    ll possible = 0;
    for (int i = 0; i < n ; i++) {
        ll val = a[i] * m;
        if (val < x)
            continue;
        ll diff = val - x;
        possible += diff / a[i];
    }

    for (int i = 0; i < n; i++) {
        ll val = a[i] * m;
        if (val >= x)
            continue;
        ll dif = x - val;
        ll needed = dif / b[i];
        if (dif % b[i])
            needed++;
        possible -= needed;
    }
    return possible < 0;
}

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

    cin >> n >> m;

    a.resize(n);
    b.resize(n);
    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]);
    }

    ll l = 0, r = 5e18;
    while (l < r) {
        ll mid = (l + r) / 2;
        if (binary(mid))
            r = mid;
        else
            l = mid + 1;
    }

    cout << l - 1<< "\n";
}

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