제출 #538087

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
538087		ddy888	Self Study (JOI22_ho_t2)	C++17	100 / 100	235 ms	10868 KiB

Main

#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long 
#define ll long long 
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr<<" "<<to_string(H);debug_out(T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)

int N, M;
int A[300010], B[300010];

int good(int x) {
    int cnt = 0ll; 
    for (int i = 1; i <= N; ++i) {
        if (M * A[i] >= x) cnt += (x + A[i] - 1ll) / A[i];
        else {
            cnt += M;
            cnt += (x - M * A[i] + B[i] - 1ll) / B[i];
        }
        if (cnt > M * N) return 0;
    }
    return 1;
}

int32_t main() {
    fast;
    cin >> N >> M;
    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]);
    }
    int lo = 0, hi = 6e18;
    while (lo + 1 < hi) {
        int mid = (lo + hi) / 2;
        if (good(mid)) lo = mid;
        else hi = mid;
    }
    cout << lo; 
    return 0;
}

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