oj.uz

Submission #940668

# Submission time Handle Problem Language Result Execution time Memory
940668 2024-03-07T13:00:10 Z Macker Combo (IOI18_combo) C++17
5 / 100
 1 ms 596 KB 
#include "combo.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define FOR(i, n) for (int i = 0; i < n; i++)


string guess_sequence(int N) {
    string s = "";
    char fir;
    if(press("AB")){
        if(press("A")) fir = 'A';
        else fir = 'B';
    }
    else{
        if(press("X")) fir = 'X';
        else fir = 'Y';
    }
    string t("ABXY");
    int x = t.find(fir);
    t.erase(x, 1);
    s.push_back(fir);

    FOR(i, N - 2){
        string q;
        q.append(s);
        q.append({t[0], t[0]});
        q.append(s);
        q.append({t[0], t[1]});
        q.append(s);
        q.append({t[0], t[2]});
        q.append(s);
        q.append({t[1]});
        int a = press(q) - s.size();
        if(a == 2) s.push_back(t[0]);
        else if(a == 1) s.push_back(t[1]);
        else s.push_back(t[2]);
    }

    s.push_back(t[0]);
    if(press(s) != s.size()){
        s.pop_back();
        s.push_back(t[1]);
        if(press(s) != s.size()){
            s.pop_back();
            s.push_back(t[2]);
        }
    }
    return s;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:48:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     if(press(s) != s.size()){
      |        ~~~~~~~~~^~~~~~~~~~~
combo.cpp:51:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         if(press(s) != s.size()){
      |            ~~~~~~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.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 0 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 504 KB Output is correct
8 Correct 0 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 596 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 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 0 ms 416 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 0 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
0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer: wrong guess.
2 Halted 0 ms 0 KB -