| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1282139 | cjspd_oly | Lost in the cycle (IOI19_cycle) | C++17 | 1 ms | 336 KiB |
#include "cycle.h"
#include <bits/stdc++.h>
using namespace std;
void escape(int n)
{
int p = n;
int l = 0, r = n - 1;
while (l < r)
{
int m = (l + r + 1) / 2;
if (jump(max(m - p + n, 1)) % 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... | ||||
