제출 #891661

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891661		12345678	Self Study (JOI22_ho_t2)	C++17	100 / 100	211 ms	10936 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e5+5;
ll n, m, a[nx], b[nx], l=1, r=1e18, c;

bool check(ll x)
{
    ll vl=n*m;
    for (int i=1; i<=n; i++)
    {
        if (b[i]>=a[i]) c=(x%b[i]==0)?(x/b[i]):(x/b[i]+1);
        else
        {
            if (a[i]*m>=x) c=(x%a[i]==0)?(x/a[i]):(x/a[i]+1);
            else
            {
                ll tmp=x-a[i]*m;
                c=m+((tmp%b[i]==0)?(tmp/b[i]):(tmp/b[i]+1));
            }
        }
        if (vl<c) return 0;
        vl-=c;
    }
    return 1;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int i=1; i<=n; i++) cin>>b[i];
    while (l<r)
    {
        ll md=(l+r+1)/2;
        if (check(md)) l=md;
        else r=md-1;
    }
    cout<<l;
}

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