제출 #1333305

#제출 시각아이디문제언어결과실행 시간메모리
1333305mtilordSelf Study (JOI22_ho_t2)C++20
54 / 100
97 ms5128 KiB
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;

ll mas[300001], mas2[300001];

bool var(ll x, ll n, ll m)
{
    ll vaj=0, ir=n*m;
    for(int i=1; i<=n; i++)
    {
        vaj+=(x+mas[i]-1)/mas[i];
        if(vaj>ir)
            return 0;
    }
    return (ir>=vaj);
}

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n, m;
    cin >> n >> m;
    for(ll i=1; i<=n; i++)
        cin >> mas[i];
    for(ll i=1; i<=n; i++)
        cin >> mas2[i];
    ll l=1, r=1e18;
    while(l<r)
    {
        ll mid=(l+r+1)/2;
        if(var(mid, n, m))
            l=mid;
        else
            r=mid-1;
    }
    cout << l << endl;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...