| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 71757 | 2018-08-25T14:43:28 Z | tamref_official_fanclub(#2249, imeimi2000) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 2 ms | 484 KB |
#include "ant.h"
int FindK(){int s=1,e=99999999;int m=(s+e+e)/3;int ret=DeliverCount(m);if(ret==0)s=m+1;else if(ret==1)s=m/2+1,e=m;else e=m/2;
while(s<e){m=(s+e)/2;if(DeliverCount(m))e=m;else s=m+1;}return s;}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 256 KB | Correct |
| 2 | Correct | 2 ms | 360 KB | Correct |
| 3 | Correct | 2 ms | 428 KB | Correct |
| 4 | Correct | 2 ms | 428 KB | Correct |
| 5 | Correct | 2 ms | 484 KB | Correct |