# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955031 | sleepntsheep | Self Study (JOI22_ho_t2) | C11 | 434 ms | 13908 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=max_(0,k-a[i]*aa[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];
if(take+bb[i]<2e18)
take+=bb[i];
}
//printf(" : %lld = %lld %lld\n",k,free,take); for(int i=1;i<=n;++i) printf(" . %lld %lld\n",aa[i],bb[i]);
return take<=free;
}
int main()
{
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... |