Submission #947821

#	Time	Username	Problem	Language	Result	Execution time	Memory
947821		quanlt206	Lost in the cycle (IOI19_cycle)	C++17	0 / 100	1 ms	596 KiB

cycle

#include "cycle.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */
void escape(int n) {
    if (jump(0) == false) {
        // dang dung o nua dau tien 0 -> n / 2 - 1
        bool kt;
        do {
            kt = jump(1);
        } while (kt == false);
        jump(n / 2);
    }
    else {
        bool kt;
        do {
            kt = jump(1);
        } while (kt == true);
        jump(n - 1);
    }
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 33
• Subtask 3: 0 / 56