#include "cycle.h"
#include <bits/stdc++.h>
using namespace std;
//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void escape(int n) {
if(n <= 30) {
if(jump(0)) jump(n/2);
while(1) {
if(jump(1)) break;
}
jump(n/2);
return;
}
int sz=n+1, prev=0;
while(sz) {
if(jump((sz+prev)%n)) {
prev = 0;
} else {
prev = n-sz;
}
sz /= 2;
}
jump(prev);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
4 ms |
256 KB |
Output is correct |
| 4 |
Correct |
5 ms |
256 KB |
Output is correct |
| 5 |
Correct |
4 ms |
384 KB |
Output is correct |
| 6 |
Correct |
4 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
256 KB |
Output is correct |
| 8 |
Correct |
4 ms |
256 KB |
Output is correct |
| 9 |
Correct |
4 ms |
256 KB |
Output is correct |
| 10 |
Correct |
4 ms |
256 KB |
Output is correct |
| 11 |
Correct |
5 ms |
256 KB |
Output is correct |
| 12 |
Correct |
5 ms |
512 KB |
Output is correct |
| 13 |
Correct |
4 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
256 KB |
Output is correct |
| 15 |
Correct |
4 ms |
256 KB |
Output is correct |
| 16 |
Correct |
4 ms |
256 KB |
Output is correct |
| 17 |
Correct |
5 ms |
384 KB |
Output is correct |
| 18 |
Correct |
4 ms |
256 KB |
Output is correct |
| 19 |
Correct |
4 ms |
384 KB |
Output is correct |
| 20 |
Correct |
4 ms |
384 KB |
Output is correct |
| 21 |
Correct |
5 ms |
256 KB |
Output is correct |
| 22 |
Correct |
4 ms |
256 KB |
Output is correct |
| 23 |
Correct |
5 ms |
256 KB |
Output is correct |
| 24 |
Correct |
5 ms |
256 KB |
Output is correct |
| 25 |
Correct |
4 ms |
384 KB |
Output is correct |
| 26 |
Correct |
5 ms |
256 KB |
Output is correct |
| 27 |
Correct |
4 ms |
256 KB |
Output is correct |
| 28 |
Correct |
5 ms |
256 KB |
Output is correct |
| 29 |
Correct |
5 ms |
256 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
5 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 |
4 ms |
256 KB |
Output is correct |
| 6 |
Correct |
5 ms |
256 KB |
Output is correct |
| 7 |
Correct |
4 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 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 |
1 ms |
256 KB |
Output is correct |
| 15 |
Correct |
5 ms |
256 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
4 ms |
256 KB |
Output is correct |
| 4 |
Correct |
5 ms |
256 KB |
Output is correct |
| 5 |
Correct |
4 ms |
384 KB |
Output is correct |
| 6 |
Correct |
4 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
256 KB |
Output is correct |
| 8 |
Correct |
4 ms |
256 KB |
Output is correct |
| 9 |
Correct |
4 ms |
256 KB |
Output is correct |
| 10 |
Correct |
4 ms |
256 KB |
Output is correct |
| 11 |
Correct |
5 ms |
256 KB |
Output is correct |
| 12 |
Correct |
5 ms |
512 KB |
Output is correct |
| 13 |
Correct |
4 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
256 KB |
Output is correct |
| 15 |
Correct |
4 ms |
256 KB |
Output is correct |
| 16 |
Correct |
4 ms |
256 KB |
Output is correct |
| 17 |
Correct |
5 ms |
384 KB |
Output is correct |
| 18 |
Correct |
4 ms |
256 KB |
Output is correct |
| 19 |
Correct |
4 ms |
384 KB |
Output is correct |
| 20 |
Correct |
4 ms |
384 KB |
Output is correct |
| 21 |
Correct |
5 ms |
256 KB |
Output is correct |
| 22 |
Correct |
4 ms |
256 KB |
Output is correct |
| 23 |
Correct |
5 ms |
256 KB |
Output is correct |
| 24 |
Correct |
5 ms |
256 KB |
Output is correct |
| 25 |
Correct |
4 ms |
384 KB |
Output is correct |
| 26 |
Correct |
5 ms |
256 KB |
Output is correct |
| 27 |
Correct |
4 ms |
256 KB |
Output is correct |
| 28 |
Correct |
5 ms |
256 KB |
Output is correct |
| 29 |
Correct |
5 ms |
256 KB |
Output is correct |
| 30 |
Correct |
5 ms |
256 KB |
Output is correct |
| 31 |
Correct |
5 ms |
384 KB |
Output is correct |
| 32 |
Correct |
4 ms |
256 KB |
Output is correct |
| 33 |
Correct |
4 ms |
256 KB |
Output is correct |
| 34 |
Correct |
4 ms |
256 KB |
Output is correct |
| 35 |
Correct |
5 ms |
256 KB |
Output is correct |
| 36 |
Correct |
4 ms |
256 KB |
Output is correct |
| 37 |
Correct |
5 ms |
256 KB |
Output is correct |
| 38 |
Correct |
5 ms |
256 KB |
Output is correct |
| 39 |
Correct |
5 ms |
256 KB |
Output is correct |
| 40 |
Correct |
5 ms |
256 KB |
Output is correct |
| 41 |
Correct |
5 ms |
256 KB |
Output is correct |
| 42 |
Correct |
5 ms |
256 KB |
Output is correct |
| 43 |
Correct |
1 ms |
256 KB |
Output is correct |
| 44 |
Correct |
5 ms |
256 KB |
Output is correct |
| 45 |
Incorrect |
5 ms |
384 KB |
The exit was not found. |
| 46 |
Halted |
0 ms |
0 KB |
- |
