| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1282132 | cjspd_oly | Lost in the cycle (IOI19_cycle) | C++17 | 1 ms | 332 KiB |
#include "cycle.h"
void escape(int n)
{
int p = 0;
int l = 0, r = n - 1;
while (l < r)
{
int m = (l + (r - l) + 1) / 2;
if (jump(m - p + n) % n)
l = m;
else
r = m-1;
p = m;
}
jump((l - p + n) % n);
return;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
