# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71777 | 2018-08-25T15:28:50 Z | Give_Me_Vita(#2255, gs13105) | The Ant Doing Hard Work (FXCUP3_ant) | C++ | 3 ms | 564 KB |
#include "ant.h" int FindK() { int s = 1; int g = 99999999; while(s < g) { int x = (s + g) / 2; if(DeliverCount(x) == 0) s = x + 1; else g = x; } return s; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 3 ms | 376 KB | Partially correct : C = 27 |
2 | Partially correct | 2 ms | 376 KB | Partially correct : C = 27 |
3 | Partially correct | 3 ms | 376 KB | Partially correct : C = 27 |
4 | Partially correct | 2 ms | 408 KB | Partially correct : C = 27 |
5 | Partially correct | 2 ms | 564 KB | Partially correct : C = 27 |