#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <bitset>
#include "cycle.h"
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0);
void solve(int n) {
int lo = 0, hi = n / 2;
int cur = 0;
while (lo < hi) {
int mid = (lo + hi) / 2;
bool valid;
if (mid > cur) {
valid = jump(mid - cur);
}
else {
valid = jump((n - (cur - mid)));
}
cur = mid;
if (valid) {
hi = mid;
}
else {
lo = mid + 1;
}
}
jump((lo - cur));
jump((n / 2));
return;
}
void escape(int n) {
bool found = jump(0);
if (found == false) {
solve(n);
}
else {
bool check = jump(n / 2);
if (check) {
bool yes = jump(1);
if (yes) {
jump(n - 1);
jump(n / 2);
return;
}
else{
jump(n - 1);
return;
}
}
else {
solve(n);
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Incorrect |
1 ms |
364 KB |
The exit was not found. |
3 |
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 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Incorrect |
1 ms |
364 KB |
The exit was not found. |
3 |
Halted |
0 ms |
0 KB |
- |