Submission #538079

#	Time	Username	Problem	Language	Result	Execution time	Memory
538079		ddy888	Self Study (JOI22_ho_t2)	C++17	0 / 100	335 ms	5108 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 unsigned long long 
#define ll unsigned 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 = 0; 
    for (int i = 1; i <= N; ++i) {
        int a = 0, b = 0;
        if (x <= A[i] * M) {
            a = (ll)(x + A[i] - 1) / (ll)A[i];
        } else { 
            a = M;
            b = (ll)(x - (M * A[i]) + B[i] - 1) / (ll)B[i];
        } 
        cnt += a + b;
        if (a * (ll)A[i] + b * (ll)B[i] < x) return 0;
    }
    return cnt <= (ll)M * N;
}

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 = (1ll << 61);
    while (lo + 1 < hi) {
        int mid = (lo + hi) / 2;
        if (good(mid)) lo = mid;
        else hi = mid;
    }
    cout << lo;
    return 0;
}

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