# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369238 | chienyu_xiong | Lost in the cycle (IOI19_cycle) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
* CM = March
* M = April
* IM = July
* GM = September
* IGM = December
*/
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long int lli;
#define pll pair<lli, lli>
#define pil pair<int, lli>
#define pli pair<lli, int>
#define pii pair<int, int>
#define pdd pair<double, double>
#define vi vector<int>
#define vl vector<lli>
#define dmx(x, y) x = max(x, y)
#define dmn(x, y) x = min(x, y)
using namespace std;
void setIO(string str, bool dbg) {
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(nullptr);
if (!dbg) {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
const int MAX = 1e5 + 5;
const int LEN = 2e1 + 1;
const int LVL = 2e1 + 0;
const lli MOD = 1e9 + 7;
const lli INF = 9e17;
int xyz = 1; // test cases
/*
bool jump(int dis) {
return jump(dis);
//tmp += dis;
//tmp %= n;
//return tmp == 0 || tmp > (n / 2);
}
*/
void escape(int n) {
auto amount = [](int src, int dst, int n) {
return (dst - src + n) % n;
};
bool val = jump(0);
if (!val) {
//cout << "debug" << endl;
if (!jump((n + 1) / 2)) {
jump(n - 1); return;
}
}
int cur = 0;
int lo = 0;
int hi = n / 2;
while (lo < hi) {
int mid = (lo + hi + 1) / 2;
int cng = amount(cur, mid, n);
if (!jump(cng)) hi = mid - 1;
else lo = mid;
cur = mid;
//cout << lo << " " << hi << ": " << cur << endl;
}
jump(amount(cur, lo, n));
}