# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526868 | eecs | Self Study (JOI22_ho_t2) | C++17 | 263 ms | 8020 KiB |
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;
typedef long long ll;
const int maxn = 300010;
int n, m;
ll a[maxn], b[maxn];
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
for (int i = 1; i <= n; i++) {
scanf("%lld", &b[i]);
}
auto chk = [&](ll lim) {
__int128 sum = 0;
for (int i = 1; i <= n; i++) {
ll rem = lim;
if (a[i] > b[i]) {
ll t = min(1LL * m, (lim + a[i] - 1) / a[i]);
sum += t, rem -= t * a[i];
}
sum += (rem + b[i] - 1) / b[i];
}
return sum <= 1LL * n * m;
};
ll l = 0, r = 1e18, ans;
while (l <= r) {
ll mid = (l + r) / 2;
chk(mid) ? l = (ans = mid) + 1 : r = mid - 1;
}
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | 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... |