# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923032 | ting39 | Self Study (JOI22_ho_t2) | C++17 | 452 ms | 11628 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>
#define int long long
using namespace std;
int n,m;
vector<int> a,b;
int dv(int x,int y){
if(x<=0||y*(x/y)==x) return x/y;
else return x/y+1;
}
bool check(int x){
int all=0;
for(int i=0;i<n;i++){
int emp=0,ext=0;
all+=min(dv(x,a[i]),m);
all+=max(dv(x-m*a[i],b[i]),0LL);
if(n*m<all) return 0;
}
return 1;
}
signed main(){
cin>>n>>m;
a.resize(n);
b.resize(n);
for(int &i:a) cin>>i;
for(int i=0;i<n;i++){
cin>>b[i];
a[i]=max(a[i],b[i]);
}
int l=0,r=1e18,mid;
while(r-l>1){
mid=(l+r)/2;
if(check(mid)) l=mid;
else r=mid;
}
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... |