# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348016 | 2021-01-14T03:56:09 Z | laoriu | Lost in the cycle (IOI19_cycle) | C++14 | 1 ms | 364 KB |
#include "cycle.h" #include <bits/stdc++.h> using namespace std; void escape(int n) { if (n == 2) { jump(1); return; } int lo, hi; if (jump(0)) { lo = (n + 1) / 2; hi = n - 1; } else { lo = 1; hi = (n + 1) / 2 - 1; } int pre = 0, res; while (lo <= hi) { int mi = (lo + hi) / 2; if (jump((pre + n - mi) % n)) { hi = mi - 1; res = mi; } else lo = mi + 1; pre = mi; } jump(pre + n - res); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Invalid argument. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Invalid argument. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Invalid argument. |
2 | Halted | 0 ms | 0 KB | - |