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;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n+1), b(n+1);
for(int i=1; i<=n; i++) cin >> a[i];
for(int i=1; i<=n; i++) cin >> b[i];
for(int i=1; i<=n; i++) a[i] = max(a[i], b[i]);
__int128_t l=1, r=1e18, ans=0;
while(l <= r) {
__int128_t mid = (l + r) / 2;
ll total = 0;
for(int i=1; i<=n; i++) {
if(a[i] * m >= mid) total += (mid + a[i] - 1) / a[i];
else total += (mid - a[i] * m + b[i] - 1) / b[i] + m;
if(total > n * m) {
total = n * m + 1;
break;
}
}
if(total <= n * m) ans = mid, l = mid + 1;
else r = mid - 1;
}
cout << (ll)ans << '\n';
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... |