# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696219 | Deepesson | Self Study (JOI22_ho_t2) | C++17 | 149 ms | 5016 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 MAX 305000
using ll = long long;
ll A[MAX],B[MAX];
ll N,M;
ll teto(ll a,ll b){
ll c = a/b;
if(a%b)++c;
return c;
}
bool possivel(ll x){
ll sum=0;
for(int i=0;i!=N;++i){
ll necessario = teto(x,A[i]);
ll gastar = std::min(necessario,M);
ll falta = x-(gastar*A[i]);
if(falta>0){
ll precisa = teto(falta,B[i]);
sum-=precisa;
}else {
ll sobra = M-gastar;
sum+=sobra;
}
}
return sum>=0;
}
# | 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... |