# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228109 | 2020-04-30T00:34:34 Z | jzh | Lost in the cycle (IOI19_cycle) | C++14 | 5 ms | 384 KB |
#include "cycle.h" #include <bits/stdc++.h> using namespace std; void escape (int n){ int hi=n-1,lo=0,mid,x=0,y; bool b,b1; b1 = jump(0); while (hi>lo){ mid = lo + (hi-lo)/2 + (hi-lo)%2; //cout<<mid<<' '<<x; y = mid-x; if (y<0)y+=n; x+=y;//i.e. x = mid x%=n; //cout<<' '<<x<<' '<<y<<'\n'; if (jump(y)){ lo = mid; b = true; } else { hi = mid-1; b = false; } //cout<<"Bool: "<<b<<'\n'; } //cout<<lo<<' '<<x<<'\n'; if (lo == n-1 && b1){ jump(1); } else if (lo<x){ jump(n-1); } else if (lo>x){ jump(1); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Incorrect | 4 ms | 256 KB | The exit was not found. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 4 ms | 256 KB | Output is correct |
4 | Correct | 4 ms | 256 KB | Output is correct |
5 | Correct | 5 ms | 384 KB | Output is correct |
6 | Correct | 5 ms | 384 KB | Output is correct |
7 | Correct | 4 ms | 256 KB | Output is correct |
8 | Correct | 4 ms | 256 KB | Output is correct |
9 | Correct | 5 ms | 256 KB | Output is correct |
10 | Correct | 5 ms | 256 KB | Output is correct |
11 | Correct | 5 ms | 256 KB | Output is correct |
12 | Correct | 5 ms | 256 KB | Output is correct |
13 | Correct | 5 ms | 256 KB | Output is correct |
14 | Correct | 5 ms | 256 KB | Output is correct |
15 | Correct | 5 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Incorrect | 4 ms | 256 KB | The exit was not found. |
3 | Halted | 0 ms | 0 KB | - |