Submission #534206

#	Time	Username	Problem	Language	Result	Execution time	Memory
534206		Paul_Liao_1457	Self Study (JOI22_ho_t2)	C++14	0 / 100	0 ms	204 KiB

Main

// 還要更強
#include<iostream>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<math.h>
#include<cstring>
#include<stack>
#include<string.h>
#include<random>
#include<algorithm>
#include<vector>
#include <cassert>

#define ll long long
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define INF (ll)(2e18)
#define pb push_back
#define F first
#define S second

using namespace std;

ll n,m;
ll aaa[300005],bbb[300005];


signed main(){
    cin>>n>>m;
    FOR(i,1,n+1) cin>>aaa[i];
    FOR(i,1,n+1) cin>>bbb[i];
    ll l=0,r=20,ans=0;
    while(l<r){
        ll mid=(l+r)/2,tot=0;
        FOR(i,1,n+1){
            if(max(bbb[i],aaa[i])*m<mid){
                ll tmp=mid-max(bbb[i],aaa[i])*m;
                tot+=(tmp-1)/bbb[i]+1;
            }
            else{
                ll tmp=(mid-1)/max(bbb[i],aaa[i])+1;
                tot-=m-tmp;
            }
        }
        //cout<<"mid="<<mid<<" tot="<<tot<<endl;
        if(tot<=0){
            ans=max(ans,mid);
            l=mid+1;
        }
        else{
            r=mid;
        }
    }
    cout<<ans<<endl;
}

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