제출 #863802

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

Main

#include<bits/stdc++.h>
typedef long long ll;
#define fastio cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
using namespace std;

inline ll divide(ll a, ll d){
    return (a-1)/d+1;
}

int main(){
    fastio
    int n;
    ll m, l = 1, r = 1e18;
    cin >> n >> m;
    vector<ll> a(n), b(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++){
        cin >> b[i];
        a[i] = max(a[i], b[i]);
    }
    while(l!=r){
        ll g = (l+r+1)>>1, cnt = 0;
        for(int i=0; i<n; i++){
            ll tmp = divide(g, a[i]);
            if(tmp>m) cnt += m+divide(g-a[i]*m, b[i]);
            else cnt += tmp;
        }
        if(cnt>m*n) r = g-1;
        else l = g;
    }
    cout << r << '\n';
    return 0;
}

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