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 int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> 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]);
int l = 1, r = 1e18, sol = 0;
while (l <= r) {
int mid = (l + r) / 2;
int days = 0;
int need = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] * m >= mid) {
days += (a[i] * m - mid) / a[i];
} else {
need += (mid - a[i] * m + b[i] - 1) / b[i];
}
}
if (need <= days) {
sol = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
cout << sol << "\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... |