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<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define ld long double
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n, m;cin>>n>>m;
vector<ll>a(n), b(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
ll l(0), r = 2e18;
while(l<r){
ll mid = (l+r)/2;
//cout<<mid<<" "<<l<<" "<<r<<endl;
ll ext(0);
for(int i=0;i<n;i++){
ext += max((ll)(m - ceil((ld)mid/max(a[i], b[i]))), 0ll);
}
for(int i=0;i<n;i++){
if(m*max(a[i], b[i])>=mid)continue;
ll sm = ceil((ld)(mid - m*max(a[i], b[i]))/b[i]);
ext-=sm;
}
if(ext<0){
r=mid;
}
else l = mid+1;
}
cout<<l-1<<endl;
return 0;
}
# | 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... |