제출 #984784

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
984784		vjudge1	Self Study (JOI22_ho_t2)	C++17	100 / 100	237 ms	10936 KiB

Main

#include<bits/stdc++.h>
#define ft first
#define sd second
#define pb push_back
#define nl "\n"
#define int ll
typedef long long ll;
typedef long double ld;
using namespace std;

const int mod = 1e9 + 7;
const int N = 2000;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    while(T--) {
        int n, m;
        cin >> n >> m;
        int a[n + 1], b[n + 1], mn = 1e18, mx = 0;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
        }
        for (int i = 1; i <= n; i++) {
            cin >> b[i];
            a[i] = max(a[i], b[i]);
            mn = min( mn, a[i] * m);
            mx = max( mx, a[i] * m);
        }
        int l = mn, r = mx + 1;
        int inf = 1e18;
        while(l + 1 < r) {
            int mid = (l + r) / 2;
            int s = 0;
            for (int i = 1; i <= n; i++) {
                if (m >= (mid - 1) / a[i] + 1) {
                    s += (m - ((mid - 1) / a[i] + 1));
                } else {
                    int res = mid - a[i] * m;
                    s -= ((res - 1) / b[i] + 1);
                }
                if (abs(s) > inf) break;
            }
            if (s >= 0) {
                l = mid;
            } else {
                r = mid;
            }
        }
        cout << l << nl;
    }
}

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