| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1330201 | apxo | Lost in the cycle (IOI19_cycle) | C++20 | 1 ms | 400 KiB |
#include "cycle.h"
void escape(int n) {
int lst = 0;
int l, r, res = -1;
if (jump(0)) {
l = 0, r = n / 2;
} else {
l = n / 2 + 1, r = n - 1;
}
while (l <= r) {
int mid = (l + r) >> 1;
if (jump((mid - lst + n) % n)) {
res = mid;
l = mid + 1;
} else r = mid - 1;
lst = mid;
}
jump((res - lst + n) % n);
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
