제출 #595496

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
595496		someone	Self Study (JOI22_ho_t2)	C++14	0 / 100	307 ms	10796 KiB

Main

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 3e5 + 42, INF = 1e18;

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

bool possible(int mini) {
    int need = 0;
    for(int i = 0; i < n; i++)
        if(m * a[i] < mini)
            need += (mini - m * a[i] + b[i] - 1) / b[i];
        else
            need -= m - (mini + a[i] - 1) / a[i];
    return need <= 0;
}

int dicho(int deb, int fin) {
    if(deb + 1 == fin)
        return deb;

    int mid = (deb + fin) >> 1;
    if(possible(mid))
        return dicho(mid, fin);
    return dicho(deb, mid);
}

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

    cin >> n >> m;
    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]);

    cout << dicho(0, INF);
}

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