oj.uz

Submission #589174

# Submission time Handle Problem Language Result Execution time Memory
589174 2022-07-04T09:54:55 Z Mahtimursu Combo (IOI18_combo) C++17
100 / 100
 49 ms 640 KB 
#include "combo.h"
#include <bits/stdc++.h>

using namespace std;

string opt[] = {"A", "B", "X", "Y"};
vector<string> oth; 

unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();

string get_p() {
    if (press(opt[0] + opt[1]) >= 1) {
        if (press(opt[0]) == 1) return opt[0];
        return opt[1];
    } else {
        if (press(opt[2]) == 1) return opt[2];
        return opt[3];
    }
}

string find_first() {
    string p = get_p();

    for (string c : opt) {
        if (string(1, p[0]) != c) oth.push_back(c);
    }

    return p;
}

string find_two(string sd) {
    shuffle(oth.begin(), oth.end(), mt19937(seed));
    vector<string> cmb;

    for (int i = 0; i < 2; ++i) {
        cmb.push_back(oth[0] + oth[i]);
    }
    cmb.push_back(oth[1] + oth[0]);

    string q;
    for (auto x : cmb) q += sd + x;

    int out = press(q) - sd.length();

    if (out == 2) {
        out = press(sd + oth[0] + oth[1]) - sd.length();
        if (out == 2) return oth[0] + oth[1];
        if (out == 1) return oth[0] + oth[0];
        if (out == 0) return oth[1] + oth[0];
    } else if (out == 1) {
        out = press(sd + oth[1] + oth[1]) - sd.length();

        if (out == 2) return oth[1] + oth[1];
        if (out == 1) return oth[1] + oth[2];
        if (out == 0) return oth[0] + oth[2];
    } else {
        return oth[2];
    }
} 

string find_one(string p) {
    int tre = 0;
    bool ok = 0;
    for (string c : opt) {
        if (p.length() > 0 && c == string(1, p[0])) continue;

        if (ok || press(p + c) == (int)p.length() + 1) {
            p += c;
            break;
        } else tre++;

        if (p.length() > 0 && tre == 2) ok = 1;
        if (p.length() == 0 && tre == 3) ok = 1;
    }

    return p;
}

string find_one_fast(string sd) {
    string q = sd + oth[0] + sd[0];
    for (int i = 0; i < 3; ++i) q += sd + oth[1] + oth[i];

    int out = press(q) - sd.length();

    if (out == 2) return oth[1];
    if (out == 1) return oth[0];
    return oth[2];
}

string guess_sequence(int N) {
    oth.clear();
    string p = find_first();

    while ((int)p.length() + 2 <= N) {
        p += find_two(p);
    }
    if ((int)p.length() != N) {
        p = find_one(p);
    }

    return p;
}


/*

S'AA S'AB S'BA

2 -> AA/AB/BA
-> Kysy AB
    -> 2 = AB
    -> 1 = AA
    -> 0 = BA
1 -> AX/BB/BX
-> Kysy BB
    -> 2 = BB
    -> 1 = BX
    -> 0 = AX
0 -> XA/XB/XX
    -> Lisää X


S'AY S'BA S'BB S'BX

-> 2 = B
-> 1 = A
-> 0 = X

*/

Compilation message

combo.cpp: In function 'std::string find_two(std::string)':
combo.cpp:33:20: warning: control reaches end of non-void function [-Wreturn-type]
   33 |     vector<string> cmb;
      |                    ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 17 ms 416 KB Output is correct
18 Correct 22 ms 504 KB Output is correct
19 Correct 29 ms 420 KB Output is correct
20 Correct 34 ms 508 KB Output is correct
21 Correct 31 ms 432 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 2 ms 304 KB Output is correct
26 Correct 2 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 208 KB Output is correct
29 Correct 2 ms 208 KB Output is correct
30 Correct 3 ms 208 KB Output is correct
31 Correct 2 ms 296 KB Output is correct
32 Correct 30 ms 416 KB Output is correct
33 Correct 37 ms 496 KB Output is correct
34 Correct 29 ms 472 KB Output is correct
35 Correct 37 ms 492 KB Output is correct
36 Correct 28 ms 412 KB Output is correct
37 Correct 25 ms 464 KB Output is correct
38 Correct 29 ms 540 KB Output is correct
39 Correct 39 ms 428 KB Output is correct
40 Correct 34 ms 480 KB Output is correct
41 Correct 36 ms 412 KB Output is correct
42 Correct 22 ms 640 KB Output is correct
43 Correct 27 ms 412 KB Output is correct
44 Correct 21 ms 440 KB Output is correct
45 Correct 35 ms 412 KB Output is correct
46 Correct 30 ms 524 KB Output is correct
47 Correct 38 ms 496 KB Output is correct
48 Correct 31 ms 416 KB Output is correct
49 Correct 24 ms 524 KB Output is correct
50 Correct 26 ms 584 KB Output is correct
51 Correct 28 ms 532 KB Output is correct
52 Correct 45 ms 472 KB Output is correct
53 Correct 25 ms 480 KB Output is correct
54 Correct 39 ms 492 KB Output is correct
55 Correct 28 ms 416 KB Output is correct
56 Correct 27 ms 516 KB Output is correct
57 Correct 34 ms 420 KB Output is correct
58 Correct 34 ms 604 KB Output is correct
59 Correct 36 ms 416 KB Output is correct
60 Correct 31 ms 428 KB Output is correct
61 Correct 28 ms 412 KB Output is correct
62 Correct 49 ms 416 KB Output is correct
63 Correct 37 ms 416 KB Output is correct
64 Correct 38 ms 500 KB Output is correct
65 Correct 27 ms 504 KB Output is correct
66 Correct 37 ms 516 KB Output is correct
67 Correct 39 ms 420 KB Output is correct
68 Correct 40 ms 416 KB Output is correct
69 Correct 19 ms 416 KB Output is correct
70 Correct 30 ms 536 KB Output is correct
71 Correct 30 ms 416 KB Output is correct
72 Correct 26 ms 416 KB Output is correct
73 Correct 32 ms 412 KB Output is correct
74 Correct 31 ms 544 KB Output is correct
75 Correct 28 ms 488 KB Output is correct
76 Correct 31 ms 412 KB Output is correct
77 Correct 28 ms 600 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 252 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 0 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 1 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 2 ms 208 KB Output is correct
101 Correct 1 ms 208 KB Output is correct
102 Correct 1 ms 208 KB Output is correct
103 Correct 1 ms 208 KB Output is correct
104 Correct 1 ms 208 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 1 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 1 ms 208 KB Output is correct
110 Correct 1 ms 208 KB Output is correct
111 Correct 1 ms 208 KB Output is correct
112 Correct 1 ms 300 KB Output is correct
113 Correct 1 ms 208 KB Output is correct
114 Correct 1 ms 208 KB Output is correct
115 Correct 1 ms 208 KB Output is correct
116 Correct 1 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 1 ms 300 KB Output is correct
119 Correct 1 ms 208 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 208 KB Output is correct
122 Correct 2 ms 300 KB Output is correct
123 Correct 1 ms 208 KB Output is correct