Submission #573032

#	Time	Username	Problem	Language	Result	Execution time	Memory
573032		groshi	Self Study (JOI22_ho_t2)	C++17	0 / 100	496 ms	5040 KiB

Main

#include<iostream>

using namespace std;
#define int long long
long long a[1000000],b[1000000];
long long n,m;
bool ok(long long ile)
{
    //cout<<"check "<<ile<<"\n";
    long long biore=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]>b[i])
        {
            long long ile_kursow_ja=ile/a[i];
            if(ile%a[i]!=0)
                ile_kursow_ja++;
            if(ile_kursow_ja<=m)
            {
                biore+=ile_kursow_ja;
                continue;
            }
            else{
                biore+=m;
                long long reszta=ile-m*a[i];
                long long dod=reszta/b[i];
                if(reszta%b[i]!=0)
                    dod++;
                biore+=dod;
                continue;
            }
        }
        long long ile_kursow=ile/b[i];
        if(ile%b[i]!=0)
            ile_kursow++;
        biore+=ile_kursow;
        //cout<<ile_kursow_ja<<" "<<wolne<<"\n";
    }

    if(biore<=n*m)
        return 1;
    else return 0;
}
int32_t main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
        cin>>b[i];
    long long pocz=0,kon=3*1e18+1,sre,ostd=0;
    while(pocz<kon)
    {
        sre=(pocz+kon)/2;
        //cout<<sre<<": "<<ok(sre)<<"\n";
        if(ok(sre))
        {
            ostd=sre;
            pocz=sre+1;
        }
        else kon=sre;
    }
    cout<<ostd;
    return 0;
}

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