# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1123749 | Neco_arc | Self Study (JOI22_ho_t2) | C++20 | 134 ms | 2800 KiB |
#include <bits/stdc++.h>
#define ll long long
#define name "Self Study"
#define fi(i, a, b) for(int i = a; i <= b; ++i)
#define fid(i, a, b) for(int i = a; i >= b; --i)
#define maxn (int) (2e5 + 7)
using namespace std;
ll n, k;
ll a[maxn], b[maxn];
bool check(ll X) {
ll S = 0;
fi(i, 1, n) {
ll sl = (X - 1) / a[i] + 1;
if(sl > k) {
S += k;
S += (X - k * a[i] - 1) / b[i] + 1;
}
else S += sl;
}
return S <= n * k;
}
void solve() {
cin >> n >> k;
fi(i, 1, n) cin >> a[i];
fi(i, 1, n) cin >> b[i];
fi(i, 1, n) a[i] = max(a[i], b[i]);
ll l = 0, r = 1e18;
while(l <= r) {
ll mid = (l + r) >> 1;
if(check(mid)) l = mid + 1;
else r = mid - 1;
}
cout << r;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
if(fopen(name".inp", "r")) {
freopen(name".inp", "r", stdin);
freopen(name".out", "w", stdout);
}
solve();
}
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... |