# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938002 | Litusiano | Self Study (JOI22_ho_t2) | C++17 | 426 ms | 4956 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;
bool check(int mid){
int tot = 0;
for(auto x : v){
// if(tot > n*m) break;
int mx = max(x.first,x.second);
int need = (mid+mx-1)/mx;
if(need < 0){
assert(1);
continue;
}
if(need > m){
tot+=m;
int k = (mid-mx*m + x.second-1);
if(k < 0){
assert(1);
continue;
}
tot+= (k)/x.second;
}
else tot+= need;
}
return tot <= n*m;
}
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 low = 0; int high = 1e18+5;
while(high > low+1){
int middle = (low+high)/2;
if(check(middle)) low = middle;
else high = middle;
}
cout<<low<<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... |