This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// 還要更強
#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 __int128_t
#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)(1e9)
#define pb push_back
#define F first
#define S second
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
using namespace std;
long long n,m;
ll aaa[300005],bbb[300005];
long long a[300005],b[300005];
signed main(){
AC;
cin>>n>>m;
FOR(i,1,n+1){
cin>>a[i]; aaa[i]=a[i];
}
FOR(i,1,n+1){
cin>>b[i]; bbb[i]=b[i]; aaa[i]=max(a[i],b[i]);
}
ll l=0,r=(3e18+1),ans=0;
while(l<r){
ll mid=(l+r)/2,tot=0;
FOR(i,1,n+1){
if(aaa[i]*m<mid){
ll tmp=mid-aaa[i]*m;
tot+=(tmp-1)/bbb[i]+1;
}
else{
ll used=(mid-1)/aaa[i]+1;
tot-=m-used;
//cerr<<"m="<<m<<endl;
}
//cout<<"m="<<m<<endl;
}
//cout<<"mid="<<mid<<" tot="<<tot<<endl;
if(tot<=0){
ans=max(ans,mid);
l=mid+1;
}
else{
r=mid;
}
}
cout<<(long long)ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |