제출 #941105

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

Main

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

#ifdef MIKU
const string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define dout(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 300005, INF = 3.9e18;
int n, m, a[MXN], b[MXN];

int DC(int a, int b) {
    if (a == 0) return 0;
    return (a - 1) / b + 1;
}

bool check(int x) {
    auto f = [&](int x, int a, int b) -> int {
        if (DC(x, a) <= m) return m - DC(x, a);
        x -= a * m;
        return -DC(x, b);
    };
    int now = 0;
    FOR(i, 0, n) {
        if (a[i] > b[i]) now += f(x, a[i], b[i]);
        else {
            now += m;
            now -= DC(x, b[i]);
        }
    }
    return (now >= 0);
}

int miku() {
    cin >> n >> m;
    FOR(i, 0, n) cin >> a[i];
    FOR(i, 0, n) cin >> b[i];
    int l = 0, r = INF;
    while (l + 1 < r) {
        int mid = (l + r) >> 1;
        (check(mid) ? l : r) = mid;
    }
    return l;
}

// int check() {
//     int ans = LLONG_MAX;
//     FOR(i, 0, n) ans = min(ans, max(a[i], b[i]));
//     return ans;
// }

// void PRINT() {
//     cout << n << ' ' << m << '\n';
//     FOR(i, 0, n) cout << a[i] << ' ';
//     cout << '\n';
//     FOR(i, 0, n) cout << b[i] << ' ';
//     cout << '\n';
// }

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    cout << miku() << '\n';
    return 0;
}

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