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>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define vp vector<pii>
using namespace std;
const int N=4e5+5;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
ll n,M;cin>>n>>M;
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=1,r=1e18;
while(l<r){
ll m=(l+r+1)>>1;
ll cnt=0;
for(int i=0;i<n;i++){
if(b[i]>=a[i])cnt+=ceil((double)m/b[i]);
else {
ll tt=ceil((double)m/a[i]);
if(tt<=M)cnt+=tt;
else {
cnt+=M+ceil((double)(m-M*a[i])/b[i]);
}
}
}if(cnt<=M*n)l=m;
else r=m-1;
}cout<<l;
}
# | 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... |