# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938060 | Litusiano | Self Study (JOI22_ho_t2) | C++17 | 304 ms | 13352 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;
#define int long long
#define endl "\n"
vector<pair<int,int>> v;
int n,m;
const int inf = 1e18;
bool check(int mid){
vector<int> need(n);
int left = 0;
for(int i = 0; i<n && left >= 0; i++){
int z = max(v[i].first, v[i].second);
int k = (mid+z-1)/z;
if(k > m) need[i] = mid-(m * z);
else left+=m-k;
}
for(int i = 0; i<n && left >= 0; i++){
left -= (need[i] + v[i].second - 1)/v[i].second;
}
return left>=0;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n>>m;
v.resize(n);
for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second;
int l = 0; int r = 1e18; r+= 1000;
while(r > l+1){
int mid = (l+r)/2;
// cerr<<l<<" "<<r<<" "<<mid<<" "<<check(mid)<<endl;
if(check(mid)) l = mid;
else r = mid;
}
// cerr<<check(inf)<<endl;
cout<<l<<endl;
}
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... |