제출 #703592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
703592		niter	Self Study (JOI22_ho_t2)	C++14	62 / 100	119 ms	5020 KiB

Main

#include <iostream>
#include <vector>
#define loop(i,a,b) for(int i=a;i<b;i++)
using namespace std;
long long A[300050], B[300050];

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    int N, M;
    cin >> N >> M;
    loop(i,0,N) cin >> A[i];
    loop(i,0,N) cin >> B[i];
    loop(i,0,N) A[i] = max(A[i], B[i]);

    long long ok = 0, ng = 1LL << 60;
    auto check = [&](long long x) -> bool {
        long long day = 0, cost;
        loop(i,0,N){
            cost = x;
            day += min<long long>(((cost-1) / A[i] + 1), M);
            cost -= min<long long>(((cost-1) / A[i] + 1), M) * A[i];
            if(cost > 0)
                day += ((cost-1) / B[i] + 1);
            if(day > N * M) return 0;
        }
        return 1;
    };
    while(ng >= ok + 2){
        long long mid = (ng + ok) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
    return 0;
}

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