제출 #528126

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

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)3e5 + 10;
ll A[N];
ll B[N];
ll C[N];

int main(){
    fastIO;
    //freopen("in.txt","r",stdin);
    int n;
    cin >> n;
    ll m;
    cin >> m;
    for(int i = 1; i <= n; i ++ ){
        cin >> A[i];
    }
    ll maxi = (ll)1e18;
    for(int i = 1; i <= n; i ++ ){
        cin >> B[i];
        A[i] = max(A[i], B[i]);
        maxi = min(maxi, A[i]);
    }
    ll li = 0;
    ll ri = (ll)1e16;
    ll mid;
    ll nd;
    while(li + 1 < ri){
        mid = (li + ri) / 2;
        ll can;
        nd = 0;
        for(int i = 1; i <= n; i ++ ){
            can = (mid + A[i] - 1) / A[i];
            if(can < m){
                nd += m - can;
                C[i] = 0;
            }
            else{
                C[i] = mid - A[i] * 1ll * m;
                if(C[i] < 0) C[i] = 0;
            }
        }
        for(int i = 1; i <= n; i ++ ){
            nd -= (C[i] + B[i] - 1) / B[i];
        }
        if(nd >= 0){
            li = mid;
        }
        else{
            ri = mid;
        }
    }
    cout << li << "\n";
    return 0;
}

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