oj.uz

Submission #153352

# Submission time Handle Problem Language Result Execution time Memory
153352 2019-09-13T15:24:29 Z Ruxandra985 Combo (IOI18_combo) C++14
5 / 100
 3 ms 1444 KB 
#include <cstdio>
#include <cstring>
#include "combo.h"

using namespace std;

char next (char ch){
    if (ch == 'A' || ch == 'X')
        return ch + 1;
    if (ch == 'B')
        return 'X';
    return 'A';
}

string guess_sequence (int n){
    int i,j;
    char curr,fst,scd,thd;
    string ask,sol;

    ask.clear();
    ask.push_back('A');
    ask.push_back('B');
    if (press(ask)){
        /// e A sau B
        ask.clear();
        ask.push_back('A');
        if (press(ask))
            curr = 'A';
        else curr = 'B';
    }
    else {
        /// e X sau Y
        ask.clear();
        ask.push_back('X');
        if (press(ask))
            curr = 'X';
        else curr = 'Y';
    }
    /// 2 interogari
    /// curr e primul caracter
    sol.clear();
    sol.push_back(curr);
    fst = next(curr);
    scd = next(fst);
    thd = next(scd);
    for (i=2;i<n;i++){
        ask.clear();
        for (j=0;j<sol.size();j++){
            ask.push_back(sol[j]);
        }
        ask.push_back(fst);
        ask.push_back(fst);

        for (j=0;j<sol.size();j++){
            ask.push_back(sol[j]);
        }
        ask.push_back(fst);
        ask.push_back(scd);

        for (j=0;j<sol.size();j++){
            ask.push_back(sol[j]);
        }
        ask.push_back(fst);
        ask.push_back(thd);

        for (j=0;j<sol.size();j++){
            ask.push_back(sol[j]);
        }
        ask.push_back(scd);

        int x = press(ask) - (i-1);
        if (x == 2)
            sol.push_back(fst);
        else if (x == 1)
            sol.push_back(scd);
        else sol.push_back(thd);

    }
    /// n - 2 interogari
    /// total : n interogari
    /// acum pt ultimul caracter
    ask.clear();
    for (j=0;j<sol.size();j++){
        ask.push_back(sol[j]);
    }
    ask.push_back('A');
    for (j=0;j<sol.size();j++){
        ask.push_back(sol[j]);
    }
    ask.push_back('B');
    if (press(ask) == n){
        /// e A sau B
        ask.clear();
        for (j=0;j<sol.size();j++){
            ask.push_back(sol[j]);
        }
        ask.push_back('A');
        if (press(ask)==n)
            sol.push_back('A');
        else sol.push_back('B');
    }
    else {
        /// e X sau Y
        ask.clear();
        for (j=0;j<sol.size();j++){
            ask.push_back(sol[j]);
        }
        ask.push_back('X');
        if (press(ask)==n)
            sol.push_back('X');
        else sol.push_back('Y');
    }
    return sol;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (j=0;j<sol.size();j++){
      |                  ~^~~~~~~~~~~
combo.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for (j=0;j<sol.size();j++){
      |                  ~^~~~~~~~~~~
combo.cpp:60:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for (j=0;j<sol.size();j++){
      |                  ~^~~~~~~~~~~
combo.cpp:66:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for (j=0;j<sol.size();j++){
      |                  ~^~~~~~~~~~~
combo.cpp:83:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (j=0;j<sol.size();j++){
      |              ~^~~~~~~~~~~
combo.cpp:87:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     for (j=0;j<sol.size();j++){
      |              ~^~~~~~~~~~~
combo.cpp:94:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         for (j=0;j<sol.size();j++){
      |                  ~^~~~~~~~~~~
combo.cpp:105:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |         for (j=0;j<sol.size();j++){
      |                  ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 95.0

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