제출 #921488

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

Main

#include <bits/stdc++.h>

#define int long long
#define sz(v) (int)v.size()
using namespace std;

const int maxn = (int)3e5 + 5;
const int INF = (int)1e18 + 5;

int n, m;
int a[maxn], b[maxn];

bool check(int x) {
    int rem = 0;
    for (int i = 1; i <= n; i++) {
        if (a[i] * m >= x) {
            rem += m - ((x + a[i] - 1) / a[i]);
        } else {
            rem -= (x - a[i] * m + b[i] - 1) / b[i];
        }
    }
    return rem >= 0;
}

void solve() {
    cin >> n >> m;
    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]);

    int l = 1, r = (int)2e18, mid;
    while (l < r) {
        mid = (l + r + 1) / 2;
        if (check(mid)) l = mid;
        else r = mid - 1;
    }
    cout << l << '\n';
}

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

    solve();

    return 0;
}

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