| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 71828 | Rolling Tamref (#119) | The Ant Doing Hard Work (FXCUP3_ant) | C++17 | 3 ms | 484 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 "ant.h"
int FindK() {
int tt = 1 << 26;
int q = DeliverCount(tt);
int lo = tt/(q+1), mi, hi = (q ? (tt+q-1)/q : 1e8-1);
int d;
while(hi - lo > 1){
mi = (lo + hi) >> 1;
d = DeliverCount(mi);
if(d){
hi = mi;
}else{
lo = mi;
}
}
return hi;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||