Submission #765485

# Submission time Handle Problem Language Result Execution time Memory
765485 2023-06-24T14:47:07 Z typ_ik Combo (IOI18_combo) C++17
100 / 100
37 ms 624 KB
#include "combo.h"
#include <bits/stdc++.h>

#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define watch(x) cout << (#x) << " : " << x << '\n'
#define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

//const string hidden = "XYYYYYYY";
//
//int press(string s) {
//    cout << "ask " << s << '\n';
//    int res = 0, pt = 0;
//    for (int i = 0; i < (int)s.size(); i++) {
//        if (hidden[pt] == s[i])
//            pt++;
//        else
//            pt = 0;
//        res = max(res, pt);
//        if (pt == (int)hidden.size())
//            break;
//    }
//    return res;
//}

string make_string(char x) {
    string res;
    res += x;
    return res;
}

string guess_sequence(int N) {
    // guess first letter

    int n = N;

    const vector<char> symb = {'A', 'B', 'X', 'Y'};
    vector <int> order(4);
    iota(all(order), 0);
    random_shuffle(all(order));

    char blocked = '.';

    {
        int c = press(make_string(symb[order[0]])+make_string(symb[order[1]]));
        if (c == 0) {
            c = press(make_string(symb[order[2]]));
            if (c == 1)
                blocked = symb[order[2]];
            else
                blocked = symb[order[3]];
        } else {
            c = press(make_string(symb[order[0]]));
            if (c == 1)
                blocked = symb[order[0]];
            else
                blocked = symb[order[1]];
        }
    }

    assert(blocked != '.');

    int pos = -1;
    for (int i = 0; i < 4; i++)
        if (symb[order[i]] == blocked)
            pos = i;

    assert(pos != -1);

    order.erase(order.begin() + pos);

    assert((int)order.size() == 3);

    vector <char> ss;
    for (auto i : order)
        ss.push_back(symb[i]);

    string pref = make_string(blocked);

    if (n == 1)
        return pref;

    for (int i = 1; i + 1 < n; i++) {
        vector <string> parts;
        parts.push_back(pref+ss[0]);
        parts.push_back(pref+ss[1]+ss[0]);
        parts.push_back(pref+ss[1]+ss[1]);
        parts.push_back(pref+ss[1]+ss[2]);


        string tot = "";
        for (auto& c : parts)
            tot += c;
        assert((int)tot.size() <= 4 * n);

        int c = press(tot);

        if (c == i)
            pref += ss[2];
        else if (c == i + 1)
            pref += ss[0];
        else if (c == i + 2)
            pref += ss[1];
    }

    assert((int)pref.size() == n - 1);

    int c = press(pref+ss[0]);
    if (c == n)
        return pref+ss[0];
    c = press(pref+ss[1]);
    if (c == n)
        return pref+ss[1];
    return pref+ss[2];
}

//main() {
//    srand(time(NULL));
//    boost;
//
//    string res = guess_sequence((int)(hidden.size()));
//
//    cout << "res = " << res << '\n';
//    cout << (res == hidden ? "correct" : "incorrect") << '\n';
//
//    return 0;
//}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 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 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 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 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 0 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 0 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 0 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
# 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 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 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 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 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 25 ms 496 KB Output is correct
18 Correct 20 ms 508 KB Output is correct
19 Correct 20 ms 496 KB Output is correct
20 Correct 19 ms 560 KB Output is correct
21 Correct 24 ms 500 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 2 ms 296 KB Output is correct
29 Correct 3 ms 344 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 2 ms 324 KB Output is correct
32 Correct 22 ms 504 KB Output is correct
33 Correct 23 ms 500 KB Output is correct
34 Correct 28 ms 500 KB Output is correct
35 Correct 22 ms 500 KB Output is correct
36 Correct 16 ms 500 KB Output is correct
37 Correct 21 ms 500 KB Output is correct
38 Correct 17 ms 496 KB Output is correct
39 Correct 23 ms 500 KB Output is correct
40 Correct 19 ms 500 KB Output is correct
41 Correct 23 ms 500 KB Output is correct
42 Correct 31 ms 500 KB Output is correct
43 Correct 21 ms 496 KB Output is correct
44 Correct 24 ms 496 KB Output is correct
45 Correct 22 ms 504 KB Output is correct
46 Correct 29 ms 500 KB Output is correct
47 Correct 24 ms 612 KB Output is correct
48 Correct 24 ms 512 KB Output is correct
49 Correct 25 ms 500 KB Output is correct
50 Correct 23 ms 500 KB Output is correct
51 Correct 23 ms 500 KB Output is correct
52 Correct 19 ms 496 KB Output is correct
53 Correct 37 ms 500 KB Output is correct
54 Correct 30 ms 496 KB Output is correct
55 Correct 22 ms 560 KB Output is correct
56 Correct 23 ms 496 KB Output is correct
57 Correct 22 ms 624 KB Output is correct
58 Correct 24 ms 504 KB Output is correct
59 Correct 20 ms 500 KB Output is correct
60 Correct 23 ms 500 KB Output is correct
61 Correct 22 ms 500 KB Output is correct
62 Correct 18 ms 496 KB Output is correct
63 Correct 24 ms 500 KB Output is correct
64 Correct 19 ms 508 KB Output is correct
65 Correct 23 ms 496 KB Output is correct
66 Correct 17 ms 504 KB Output is correct
67 Correct 26 ms 620 KB Output is correct
68 Correct 23 ms 500 KB Output is correct
69 Correct 20 ms 500 KB Output is correct
70 Correct 18 ms 496 KB Output is correct
71 Correct 22 ms 500 KB Output is correct
72 Correct 23 ms 568 KB Output is correct
73 Correct 18 ms 500 KB Output is correct
74 Correct 23 ms 504 KB Output is correct
75 Correct 19 ms 500 KB Output is correct
76 Correct 21 ms 500 KB Output is correct
77 Correct 22 ms 600 KB Output is correct
78 Correct 0 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 208 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 296 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 0 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 1 ms 296 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 0 ms 208 KB Output is correct
110 Correct 0 ms 208 KB Output is correct
111 Correct 0 ms 208 KB Output is correct
112 Correct 0 ms 208 KB Output is correct
113 Correct 0 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 0 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 1 ms 296 KB Output is correct
119 Correct 1 ms 300 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 1 ms 208 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct