oj.uz

Submission #938584

# Submission time Handle Problem Language Result Execution time Memory
938584 2024-03-05T10:34:41 Z Zero_OP Combo (IOI18_combo) C++14
100 / 100
 13 ms 1696 KB 
#include<bits/stdc++.h>
#include<combo.h>

using namespace std;
using int64 = int64_t;

#define     REP(i, n) for(int i = 0, _n = n; i < _n; ++i)
#define    REPD(i, n) for(int i = n - 1; i >= 0; --i)
#define  FOR(i, l, r) for(int i = l, _r = r; i <= _r; ++i)
#define FORD(i, r, l) for(int i = r, _l = l; i >= _l; --i)
#define          left __left
#define         right __right
#define          prev __prev
#define          next __next
#define           div __div
#define            pb push_back
#define            pf push_front
#define         sz(v) (int)v.size()
#define      range(v) begin(v), end(v)
#define    compact(v) v.erase(unique(range(v)), end(v))
#define      debug(v) "[" #v " = " << (v) << "]"

template<typename T>
    bool minimize(T& a, const T& b){
        if(a > b){
            a = b;
            return true;
        }
        return false;
    }

template<typename T>
    bool maximize(T& a, const T& b){
        if(a < b){
            a = b;
            return true;
        }
        return false;
    }

template<int dimension, class T>
struct vec : public vector<vec<dimension - 1, T>> {
    static_assert(dimension > 0, "Dimension must be positive !\n");
    template<typename... Args>
    vec(int n = 0, Args... args) : vector<vec<dimension - 1, T>>(n, vec<dimension - 1, T>(args...)) {}
};

template<class T>
struct vec<1, T> : public vector<T> {
    vec(int n = 0, T val = T()) : vector<T>(n, val) {}
};

string guess_sequence(int N){
    string s = "", p = "";
    p = "AB";
    if(press(p)){
        p = "A";
        if(press(p)){
            s += "A";
        }
        else{
            s += "B";
        }
    }
    else{
        p = "X";
        if(press(p)){
            s += "X";
        }
        else{
            s += "Y";
        }
    }

    if(N == 1) return s;

    string available = "";
    if(s != "A") available += "A";
    if(s != "B") available += "B";
    if(s != "X") available += "X";
    if(s != "Y") available += "Y";

    FOR(i, 2, N - 1){
        string tmp = s + available[0] + available[0] + s + available[0] + available[1] + s + available[0] + available[2] + s + available[1];
        int corrected = press(tmp);
        if(corrected == i + 1) s += available[0];
        else if(corrected == i) s += available[1];
        else s += available[2];
    }

    if(press(s + available[0]) == N) s += available[0];
    else if(press(s + available[1]) == N) s += available[1];
    else s += available[2];

    return s;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 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
16 Correct 1 ms 504 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 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 0 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 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory 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 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 1 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
16 Correct 0 ms 344 KB Output is correct
17 Correct 10 ms 1480 KB Output is correct
18 Correct 11 ms 1116 KB Output is correct
19 Correct 11 ms 1516 KB Output is correct
20 Correct 11 ms 1108 KB Output is correct
21 Correct 10 ms 1424 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 432 KB Output is correct
24 Correct 0 ms 436 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 1 ms 444 KB Output is correct
29 Correct 1 ms 448 KB Output is correct
30 Correct 1 ms 432 KB Output is correct
31 Correct 1 ms 692 KB Output is correct
32 Correct 11 ms 1264 KB Output is correct
33 Correct 10 ms 1448 KB Output is correct
34 Correct 13 ms 1472 KB Output is correct
35 Correct 11 ms 1164 KB Output is correct
36 Correct 10 ms 1132 KB Output is correct
37 Correct 11 ms 1408 KB Output is correct
38 Correct 12 ms 1388 KB Output is correct
39 Correct 10 ms 1664 KB Output is correct
40 Correct 10 ms 1216 KB Output is correct
41 Correct 11 ms 1208 KB Output is correct
42 Correct 10 ms 1472 KB Output is correct
43 Correct 11 ms 1308 KB Output is correct
44 Correct 10 ms 976 KB Output is correct
45 Correct 11 ms 1480 KB Output is correct
46 Correct 12 ms 1272 KB Output is correct
47 Correct 10 ms 1060 KB Output is correct
48 Correct 10 ms 1360 KB Output is correct
49 Correct 10 ms 1352 KB Output is correct
50 Correct 10 ms 1284 KB Output is correct
51 Correct 12 ms 1164 KB Output is correct
52 Correct 11 ms 1260 KB Output is correct
53 Correct 11 ms 1232 KB Output is correct
54 Correct 10 ms 1316 KB Output is correct
55 Correct 11 ms 1360 KB Output is correct
56 Correct 10 ms 1292 KB Output is correct
57 Correct 11 ms 1232 KB Output is correct
58 Correct 13 ms 1696 KB Output is correct
59 Correct 11 ms 1268 KB Output is correct
60 Correct 12 ms 1444 KB Output is correct
61 Correct 11 ms 1512 KB Output is correct
62 Correct 10 ms 1200 KB Output is correct
63 Correct 11 ms 1548 KB Output is correct
64 Correct 11 ms 1440 KB Output is correct
65 Correct 10 ms 1636 KB Output is correct
66 Correct 10 ms 1104 KB Output is correct
67 Correct 13 ms 1424 KB Output is correct
68 Correct 11 ms 1480 KB Output is correct
69 Correct 11 ms 1204 KB Output is correct
70 Correct 10 ms 1644 KB Output is correct
71 Correct 11 ms 984 KB Output is correct
72 Correct 11 ms 1008 KB Output is correct
73 Correct 12 ms 1492 KB Output is correct
74 Correct 10 ms 956 KB Output is correct
75 Correct 11 ms 1520 KB Output is correct
76 Correct 12 ms 1320 KB Output is correct
77 Correct 10 ms 1476 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 436 KB Output is correct
85 Correct 1 ms 596 KB Output is correct
86 Correct 0 ms 432 KB Output is correct
87 Correct 0 ms 432 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 1 ms 544 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 0 ms 436 KB Output is correct
95 Correct 0 ms 432 KB Output is correct
96 Correct 0 ms 432 KB Output is correct
97 Correct 1 ms 688 KB Output is correct
98 Correct 0 ms 432 KB Output is correct
99 Correct 1 ms 440 KB Output is correct
100 Correct 1 ms 436 KB Output is correct
101 Correct 0 ms 600 KB Output is correct
102 Correct 1 ms 436 KB Output is correct
103 Correct 0 ms 432 KB Output is correct
104 Correct 1 ms 436 KB Output is correct
105 Correct 1 ms 432 KB Output is correct
106 Correct 0 ms 344 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 344 KB Output is correct
111 Correct 0 ms 344 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Correct 1 ms 344 KB Output is correct
115 Correct 0 ms 344 KB Output is correct
116 Correct 1 ms 344 KB Output is correct
117 Correct 0 ms 344 KB Output is correct
118 Correct 0 ms 436 KB Output is correct
119 Correct 1 ms 432 KB Output is correct
120 Correct 0 ms 432 KB Output is correct
121 Correct 1 ms 432 KB Output is correct
122 Correct 1 ms 432 KB Output is correct
123 Correct 0 ms 436 KB Output is correct