# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978738 | DobromirAngelov | Self Study (JOI22_ho_t2) | C++14 | 271 ms | 5136 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 endl '\n'
using namespace std;
const int MAXN=3e5+5;
const long long INF=1e18+5;
int n,m;
long long a[MAXN];
long long b[MAXN];
bool check(long long val)
{
long long s=0;
bool fl=0;
for(int i=1;i<=n;i++)
{
long long cur=0;
if(a[i]*m>=val) cur+=(val+a[i]-1)/a[i];
else cur+=m+(val-a[i]*m+b[i]-1)/b[i];
s+=cur;
if(cur>1) fl=1;
}
if(s>n) return 0;
return 1;
}
long long ans;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>b[i];
for(int i=1;i<=n;i++) a[i]=max(a[i],b[i]);
ans=INF;
for(int i=1;i<=n;i++) ans=min(ans, a[i]);
long long l=1,r=INF;
while(l<r)
{
long long mid=(l+r+1)/2;
if(check(mid)) l=mid;
else r=mid-1;
}
//if(ans<l) cout<<1/0<<endl;
cout<<l<<endl;
return 0;
}
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... |