# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369231 | 2021-02-21T01:31:44 Z | chienyu_xiong | Lost in the cycle (IOI19_cycle) | C++17 | 0 ms | 0 KB |
/* * 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 int n; int amount(int src, int dst) { return (dst - src + n) % n; } int tmp = 3; bool move(int dis) { return jump(dis); tmp += dis; tmp %= n; return tmp == 0 || tmp > (n / 2); } void escape(int n) { bool val = move(0); if (!val) { cout << "debug" << endl; if (!move((n + 1) / 2)) { move(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); if (!move(cng)) hi = mid - 1; else lo = mid; cur = mid; //cout << lo << " " << hi << ": " << cur << endl; } move(amount(cur, lo)); cout << tmp << endl; } void fnc() { cin >> n; escape(n); } int main() { setIO("", 1); while (xyz--) fnc(); return 0; }