oj.uz

답안 #947850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947850 2024-03-17T06:36:24 Z quanlt206 Lost in the cycle (IOI19_cycle) C++17
100 / 100
 1 ms 596 KB 
#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 */
namespace sub1 {
    void Process(int n) {
        if (n == 2) {
            jump(1);
            return ;
        }
        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);
        }
    }
}

void escape(int n) {
    if (n <= 30) {
        sub1::Process(n);
        return ;
    }
    int mid = n / 2, l, r;
    int center = mid;
    if (n % 2 == 1) {
        if (jump(0) == false) l = 1, r = mid; else l = mid + 1, r = 0;
    }
    else {
        if (jump(0) == false) l = 1, r = mid - 1; else l = mid, r = 0;
    }
    if (n % 2 == 1) {
        while (l != r) {
//            cout<<l<<" "<<r<<" "<<jury.p<<"\n";
            if ((r == 0 && n - l == 1) || (r > 0 && r - l == 1)) {
                if (r == 0) {
                    if (jump(1)) return ;
                    jump(n - 1);
                    return ;
                }
                if (jump(n - l)) return ;
                jump(n - 1);
                return ;
            }
            if (l < r && r <= center) {
                // vi tri hien tai dang nam o nua false
                int mid = (l + (r == 0 ? n : r)) >> 1;
                int step = n - mid;
                if (jump(step) == false) {
                    r = (mid - l + 1);
                    l = 0;
                } else {
                    // luc dau P dang nam trong doan tu l -> mid
                    l+=step;
                    r = (mid + step) % n;
                }
            }
            else {
                // vi tri hien tai dang nam o nua true
                int mid = (l + (r == 0 ? n : r)) >> 1;
                int step = n - mid + center + 1;
                if (jump(step) == true) {
                    l = mid + step;
                    r = r + step;
                }
                else {
                    l = (l + step) % n;
                    r = (mid - 1 + step) % n;
                }
            }
            l%=n;
            r%=n;
        }
    }
    else {
        while (l != r) {
//            cout<<l<<" "<<r<<" "<<jury.p<<"\n";
            if ((r == 0 && n - l == 1) || (r > 0 && r - l == 1)) {
                if (r == 0) {
                    if (jump(1)) return ;
                    jump(n - 1);
                    return ;
                }
                if (jump(n - l)) return ;
                jump(n - 1);
                return ;
            }
            if (l < r && r <= center) {
                // vi tri hien tai dang nam o nua false
                int mid = (l + (r == 0 ? n : r)) >> 1;
                int step = n - mid;
                if (jump(step) == false) {
                    r = (mid - l + 1);
                    l = 0;
                }
                    else {
                    // luc dau P dang nam trong doan tu l -> mid
                    l+=step;
                    r = (mid + step) % n;
                }
            }
            else {
                // vi tri hien tai dang nam o nua true
                int mid = (l + (r == 0 ? n : r)) >> 1;
                int step = n - mid + center;
                if (jump(step) == true) {
                    l = mid + step;
                    r = r + step;
                }
                else {
                    l = (l + step) % n;
                    r = (mid - 1 + step) % n;
                }
            }
            l%=n;
            r%=n;
        }
    }
    jump((n - l) % n);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 368 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct

Subtask #3
56.0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 368 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 420 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1 ms 344 KB Output is correct