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 debug if(0)
const ll inf = 1e18+4;
int main() {
ios_base::sync_with_stdio(0);
cin.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];
auto check = [&](ll x) {
// if can be done with minimum >= x
__int128 res = 0;
for(int i=0; i<n; i++) {
ll y = 0;
if(b[i] >= a[i]) y += (x+(b[i]-1))/b[i];
else {
ll t = (x+(a[i]-1))/a[i];
if(t > m) {
y += m;
ll t2 = ((x-m*a[i])+(b[i]-1))/b[i];
y += t2;
} else y += t;
}
res += y;
}
//debug cerr<<"x: "<<x<<", res = "<<res<<" ; n*m = "<<n*m<<"\n";
return res <= (n*m);
};
ll lo = 0, hi = inf;
while(lo < hi) {
ll m = (lo+hi+1)/2LL;
if(check(m)) lo = m;
else hi = m-1;
}
cout<<lo<<"\n";
}
# | 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... |