# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955037 | sleepntsheep | Self Study (JOI22_ho_t2) | C11 | 395 ms | 13396 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<stdio.h>
long long max_(long long a,long long b){return a>b?a:b;}
long long min_(long long a,long long b){return a<b?a:b;}
#define N 300005
int n,m,a[N],b[N];
int ok(long long k)
{
static long long aa[N],bb[N];
for(int i=1;i<=n;++i)
{
aa[i]=min_((k+a[i]-1)/a[i],m);
long long lf;
if((k+a[i]-1)/a[i]<=m) lf=0;
else lf=k-m*1ll*a[i];
bb[i]=(lf+b[i]-1)/b[i];
}
long long free=0,take=0;
for(int i=1;i<=n;++i)free+=m-aa[i];
for(int i=1;i<=n;++i)
{
take+=bb[i];
if(take>free)return 0;
}
return 1;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)scanf("%d",a+i);
for(int i=1;i<=n;++i)scanf("%d",b+i),a[i]=max_(a[i],b[i]);
long long lower=-1,upper=3e18+5;
while(upper-lower>1)
{
long long mid=lower+(upper-lower)/2;
if(ok(mid))lower=mid;
else upper=mid;
}
printf("%lld",lower);
}
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... |