#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;
typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
void escape(int n){
int l = 0, r = n;
int p = 0;
while (l < r){
int m = (l + r) / 2;
if (jump((m - p + n) % n)) l = m;
else r = m;
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... |