oj.uz

Submission #679303

# Submission time Handle Problem Language Result Execution time Memory
679303 2023-01-08T02:38:12 Z That_Salamander Combo (IOI18_combo) C++14
100 / 100
 26 ms 608 KB 
#include <bits/stdc++.h>

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <string>

using namespace std;

int press(std::string p);

char CHARS[4] = {'A', 'B', 'X', 'Y'};

std::string guess_sequence(int N) {
    // Get first char
    int first;
    if (press("AB")) {
        if (press("A")) {
            first = 0;
        } else {
            first = 1;
        }
    } else if (press("X")) {
        first = 2;
    } else {
        first = 3;
    }

    string res = " ";
    res[0] = CHARS[first];

    vector<char> cs;
    for (char c : CHARS) {
        if (c != CHARS[first]) cs.push_back(c);
    }

    while (res.size() < N){
        if (res.size() == N - 1) {
            if (press(res + cs[0] + res + cs[1]) == res.size() + 1) {
                if (press(res + cs[0]) == res.size() + 1) {
                    res += cs[0];
                } else {
                    res += cs[1];
                }
            } else {
                res += cs[2];
            }
        } else {
            #define A cs[0]
            #define B cs[1]
            #define C cs[2]
            int x = press(res + A + A + res + A + B + res + B + A) - res.size();
            if (x == 2) {
                int y = press(res + A + A) - res.size();
                if (y == 0) {
                    res = res + B + A;
                } else if (y == 1) {
                    res = res + A + B;
                } else {
                    res = res +A + A;
                }
            } else if (x == 1) {
                int y = press(res + B + B) - res.size();
                if (y == 0) {
                    res = res + A + C;
                } else if (y == 1) {
                    res = res + B + C;
                } else if (y == 2) {
                    res = res + B + B;
                }
            } else {
                res = res + C;
            }
            #undef A
            #undef B
            #undef C
        }
    }

    return res;
}

#ifdef LOCAL_TEST
#include <random>
namespace {

constexpr int MAX_N = 2000;
constexpr int MAX_NUM_MOVES = 8000;

int N;
std::string S;

int num_moves;

void wrong_answer(const char *MSG) {
    printf("Wrong Answer: %s\n", MSG);
    exit(0);
}

}  // namespace

int press(std::string p) {
    if (++num_moves > MAX_NUM_MOVES) {
        wrong_answer("too many moves");
    }
    int len = p.length();
    if (len > 4 * N) {
        wrong_answer("invalid press");
    }
    for (int i = 0; i < len; ++i) {
        if (p[i] != 'A' && p[i] != 'B' && p[i] != 'X' && p[i] != 'Y') {
            wrong_answer("invalid press");
        }
    }
    //cout << "Testing " << p << endl;
    int coins = 0;
    for (int i = 0, j = 0; i < len; ++i) {
        if (j < N && S[j] == p[i]) {
            ++j;
        } else if (S[0] == p[i]) {
            j = 1;
        } else {
            j = 0;
        }
        coins = std::max(coins, j);
    }
    //cout << "Res = " << coins << endl;
    return coins;
}

int main() {
    /*char buffer[MAX_N + 1];
    if (scanf("%s", buffer) != 1) {
      fprintf(stderr, "Error while reading input\n");
      exit(1);
    }
    S = buffer;
    N = S.length();*/

    bool full = true;
    for (int i = 0; i < 10000; i++) {
        N = rand() % 50 + 1;

        S.resize(N);

        for (int i = 0; i < N; i++) {
            char c;
            do {
                c = CHARS[rand() % 4];
            } while (i != 0 && S[0] == c);
            S[i] = c;
        }

        cout << S << endl;

        num_moves = 0;
        std::string answer = guess_sequence(N);
        if (answer != S) {
            cout << "Guess:\n"
                 << answer << endl;
            wrong_answer("wrong guess");
            exit(0);
        }
        if (num_moves > N + 2) {
            cout << ":(" << endl;
            full = false;
        }
        printf("Accepted: %d\n", num_moves);
    }
    if (full) cout << "Full solution! :D" << endl;
    return 0;
}
#endif

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:37:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |     while (res.size() < N){
      |            ~~~~~~~~~~~^~~
combo.cpp:38:24: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |         if (res.size() == N - 1) {
      |             ~~~~~~~~~~~^~~~~~~~
combo.cpp:39:50: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             if (press(res + cs[0] + res + cs[1]) == res.size() + 1) {
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
combo.cpp:40:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |                 if (press(res + cs[0]) == res.size() + 1) {
      |                     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.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 1 ms 208 KB Output is correct
7 Correct 0 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 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 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 0 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 1 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 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 0 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 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 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 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 1 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 26 ms 448 KB Output is correct
18 Correct 26 ms 364 KB Output is correct
19 Correct 25 ms 440 KB Output is correct
20 Correct 24 ms 372 KB Output is correct
21 Correct 20 ms 472 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 208 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 1 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 1 ms 296 KB Output is correct
30 Correct 2 ms 208 KB Output is correct
31 Correct 2 ms 208 KB Output is correct
32 Correct 21 ms 608 KB Output is correct
33 Correct 24 ms 368 KB Output is correct
34 Correct 21 ms 364 KB Output is correct
35 Correct 20 ms 364 KB Output is correct
36 Correct 22 ms 368 KB Output is correct
37 Correct 21 ms 464 KB Output is correct
38 Correct 20 ms 368 KB Output is correct
39 Correct 20 ms 376 KB Output is correct
40 Correct 18 ms 368 KB Output is correct
41 Correct 19 ms 396 KB Output is correct
42 Correct 13 ms 372 KB Output is correct
43 Correct 20 ms 372 KB Output is correct
44 Correct 18 ms 368 KB Output is correct
45 Correct 24 ms 368 KB Output is correct
46 Correct 17 ms 424 KB Output is correct
47 Correct 23 ms 492 KB Output is correct
48 Correct 23 ms 368 KB Output is correct
49 Correct 17 ms 588 KB Output is correct
50 Correct 22 ms 368 KB Output is correct
51 Correct 22 ms 364 KB Output is correct
52 Correct 22 ms 488 KB Output is correct
53 Correct 17 ms 432 KB Output is correct
54 Correct 19 ms 452 KB Output is correct
55 Correct 20 ms 364 KB Output is correct
56 Correct 19 ms 480 KB Output is correct
57 Correct 25 ms 372 KB Output is correct
58 Correct 16 ms 484 KB Output is correct
59 Correct 17 ms 368 KB Output is correct
60 Correct 21 ms 372 KB Output is correct
61 Correct 23 ms 368 KB Output is correct
62 Correct 22 ms 376 KB Output is correct
63 Correct 24 ms 476 KB Output is correct
64 Correct 22 ms 364 KB Output is correct
65 Correct 21 ms 464 KB Output is correct
66 Correct 19 ms 372 KB Output is correct
67 Correct 18 ms 464 KB Output is correct
68 Correct 18 ms 364 KB Output is correct
69 Correct 21 ms 472 KB Output is correct
70 Correct 10 ms 368 KB Output is correct
71 Correct 20 ms 372 KB Output is correct
72 Correct 22 ms 468 KB Output is correct
73 Correct 19 ms 368 KB Output is correct
74 Correct 20 ms 368 KB Output is correct
75 Correct 21 ms 364 KB Output is correct
76 Correct 17 ms 372 KB Output is correct
77 Correct 21 ms 368 KB Output is correct
78 Correct 1 ms 220 KB Output is correct
79 Correct 1 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 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 0 ms 208 KB Output is correct
91 Correct 1 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 208 KB Output is correct
101 Correct 1 ms 296 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 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 0 ms 208 KB Output is correct
117 Correct 1 ms 208 KB Output is correct
118 Correct 1 ms 208 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 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct