oj.uz

Submission #988267

# Submission time Handle Problem Language Result Execution time Memory
988267 2024-05-24T11:47:12 Z Wane Combo (IOI18_combo) C++14
97 / 100
 13 ms 1732 KB 
#include <bits/stdc++.h>
#include "combo.h"

//std::string guess_sequence(int N);
//extern int press(std::string p);

using namespace std;

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

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

std::string S;
int N;
int num_moves;

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");
    }
  }
  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);
  }
  return coins;
}
*/

std::string guess_sequence(int N) {

    string S;
    
    // 1. Get first element (2 press)
    int res = press("AB");

    if (res == 0) { // It means X or Y
        res = press("X");
        if (res == 0) S += "Y";
        else S += "X";
    }
    else {
        res = press("A");
        if (res == 0) S += "B";
        else S += "A";
    }
    //cout << "Guess: " << S << '\n';
    if (N == 1) return S;

    // 2. Get second to N - 1 element ( N - 2 press)
    char d[5] = "ABXY";
    for (int i = 1; i < N - 1; i++) { // first to N - 1, we cannot send exceeding length of 4N
        char x = 0, y = 0, z = 0;
        for (int j = 0; j < 4; j++) {
            if (d[j] == S[0]) continue;
            if (x == 0) x = d[j];
            else if (y == 0) y = d[j];
            else z = d[j];
        }

        // We can determine i'th char by using this method:
        // use delimeter as FIRST CHAR AS THEY DO NOT SHOW OFF ANYMORE
        // ALSO IT IS FIRST OF STRING, it stands special

        // SxxSxySxzSz
        // -> if 2: it has x for first, because we used all x, y, z.
        // -> if 1: it has z for first
        // -> if 0: it has y for first
        string payload = S + x + x + S + x + y + S + x + z + S + z;
        res = press(payload);
        if (res == S.size() + 2) {
            S += x;
        }
        else if (res == S.size() + 1) {
            S += z;
        } else {
            S += y;
        }
        //cout << "Guess: " << S << '\n';
    }

    // 3. Get Last element (2 press)
    for (int j = 0; j < 4; j++) {
        if (d[j] == S[0]) continue;
        if (j == 3) {
            S += d[j];
            return S;
        }
        res = press(S + d[j]);
        if (res == N) {
            S += d[j];
            return S;
        }
    }
    return S;
}

/*
int main() {
    cin >> N >> S;
    cout << guess_sequence(N) << '\n';
}
*/

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:91:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         if (res == S.size() + 2) {
      |             ~~~~^~~~~~~~~~~~~~~
combo.cpp:94:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         else if (res == S.size() + 1) {
      |                  ~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 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 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 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 1 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 1 ms 344 KB Output is correct
17 Correct 1 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 1 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 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 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 1 ms 404 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 408 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct

Subtask #2
92.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 596 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 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Partially correct 0 ms 344 KB Output is partially correct
17 Correct 11 ms 1080 KB Output is correct
18 Correct 12 ms 1196 KB Output is correct
19 Correct 10 ms 1468 KB Output is correct
20 Partially correct 11 ms 1476 KB Output is partially correct
21 Correct 11 ms 1600 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Partially correct 1 ms 436 KB Output is partially correct
24 Correct 1 ms 436 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 1 ms 636 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 2 ms 700 KB Output is correct
29 Correct 1 ms 440 KB Output is correct
30 Correct 1 ms 696 KB Output is correct
31 Correct 1 ms 444 KB Output is correct
32 Correct 11 ms 1432 KB Output is correct
33 Correct 11 ms 1400 KB Output is correct
34 Correct 11 ms 1688 KB Output is correct
35 Correct 11 ms 1088 KB Output is correct
36 Partially correct 10 ms 1116 KB Output is partially correct
37 Correct 11 ms 1236 KB Output is correct
38 Correct 10 ms 880 KB Output is correct
39 Correct 11 ms 1408 KB Output is correct
40 Correct 10 ms 1148 KB Output is correct
41 Correct 10 ms 1320 KB Output is correct
42 Correct 11 ms 1468 KB Output is correct
43 Correct 11 ms 1468 KB Output is correct
44 Correct 11 ms 1620 KB Output is correct
45 Correct 11 ms 948 KB Output is correct
46 Correct 10 ms 1320 KB Output is correct
47 Correct 11 ms 1200 KB Output is correct
48 Correct 12 ms 1316 KB Output is correct
49 Correct 12 ms 976 KB Output is correct
50 Correct 11 ms 1072 KB Output is correct
51 Correct 13 ms 1320 KB Output is correct
52 Correct 11 ms 1352 KB Output is correct
53 Correct 11 ms 1404 KB Output is correct
54 Correct 11 ms 1720 KB Output is correct
55 Correct 11 ms 984 KB Output is correct
56 Correct 11 ms 1320 KB Output is correct
57 Correct 11 ms 968 KB Output is correct
58 Correct 11 ms 844 KB Output is correct
59 Correct 10 ms 1092 KB Output is correct
60 Correct 12 ms 1132 KB Output is correct
61 Correct 11 ms 1592 KB Output is correct
62 Correct 12 ms 1316 KB Output is correct
63 Correct 12 ms 1500 KB Output is correct
64 Correct 11 ms 1136 KB Output is correct
65 Partially correct 11 ms 984 KB Output is partially correct
66 Correct 13 ms 1220 KB Output is correct
67 Correct 10 ms 1244 KB Output is correct
68 Correct 12 ms 1452 KB Output is correct
69 Correct 11 ms 1140 KB Output is correct
70 Correct 11 ms 1288 KB Output is correct
71 Correct 11 ms 1328 KB Output is correct
72 Correct 12 ms 1732 KB Output is correct
73 Partially correct 11 ms 1396 KB Output is partially correct
74 Correct 11 ms 1632 KB Output is correct
75 Correct 11 ms 1608 KB Output is correct
76 Correct 11 ms 1264 KB Output is correct
77 Correct 11 ms 1268 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 1 ms 500 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Partially correct 1 ms 344 KB Output is partially correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 432 KB Output is correct
85 Correct 1 ms 440 KB Output is correct
86 Correct 1 ms 436 KB Output is correct
87 Partially correct 1 ms 432 KB Output is partially correct
88 Correct 1 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 1 ms 344 KB Output is correct
91 Correct 1 ms 344 KB Output is correct
92 Correct 1 ms 344 KB Output is correct
93 Correct 1 ms 344 KB Output is correct
94 Correct 1 ms 432 KB Output is correct
95 Correct 1 ms 500 KB Output is correct
96 Correct 1 ms 684 KB Output is correct
97 Correct 1 ms 440 KB Output is correct
98 Correct 1 ms 436 KB Output is correct
99 Partially correct 1 ms 432 KB Output is partially correct
100 Correct 1 ms 600 KB Output is correct
101 Correct 1 ms 432 KB Output is correct
102 Correct 1 ms 436 KB Output is correct
103 Correct 1 ms 436 KB Output is correct
104 Correct 1 ms 432 KB Output is correct
105 Correct 1 ms 432 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 1 ms 344 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 1 ms 344 KB Output is correct
110 Correct 1 ms 344 KB Output is correct
111 Partially correct 1 ms 344 KB Output is partially correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 1 ms 344 KB Output is correct
114 Correct 1 ms 344 KB Output is correct
115 Partially correct 1 ms 344 KB Output is partially correct
116 Correct 1 ms 344 KB Output is correct
117 Correct 1 ms 344 KB Output is correct
118 Correct 1 ms 432 KB Output is correct
119 Partially correct 1 ms 436 KB Output is partially correct
120 Correct 1 ms 432 KB Output is correct
121 Correct 1 ms 432 KB Output is correct
122 Correct 1 ms 688 KB Output is correct
123 Correct 1 ms 436 KB Output is correct