# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117513 | wellthen_ | Self Study (JOI22_ho_t2) | Java | 0 ms | 0 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>
#include <climits>
using namespace std;
typedef long long ll;
bool works(ll mid, vector<ll> classes, vector<ll> selfstudy, ll n, ll m){
//satisfy requirement for all the classes
ll time = n*m;
for(ll i = 0; i<ll(classes.size()); i++){
if(classes[i] > selfstudy[i]){
if(m * classes[i] >= mid){
time -= (mid + classes[i] - 1) / classes[i];
}
else{
time -= m;
time -= (mid - m * classes[i] + selfstudy[i] - 1) / selfstudy[i];
}
}
else {
time -= (mid + selfstudy[i] - 1) / selfstudy[i];
}
}
return time>=0;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> classes(n), selfstudy(n);
for (int i = 0; i < n; i++) {
cin >> classes[i];
}
for (int i = 0; i < n; i++) {
cin >> selfstudy[i];
}
ll lo = 0, hi = ll(1e16), best = 0;
while (lo <= hi) {
ll mid = lo + (hi - lo) / 2;
if (works(mid, classes, selfstudy, n, m)) {
best = mid;
lo = mid + 1;
} else {
hi = mid - 1;
}
}
cout << best << endl;
return 0;
}