oj.uz

Submission #79480

# Submission time Handle Problem Language Result Execution time Memory
79480 2018-10-14T09:01:16 Z alextodoran Combo (IOI18_combo) C++14
5 / 100
 2 ms 328 KB 
#include <bits/stdc++.h>
#include "combo.h"

using namespace std;
/*
string combo;

int press(string p)
{
    for(int i = 0; i < combo.size(); i++)
    {
        int ok1 = 0;
        for(int j = 0; j < p.size() - i; j++)
        {
            int ok = 1;
            for(int k = j; k <= j + i; k++)
                if(p[k] != combo[k - j])
                {
                    ok = 0;
                    break;
                }
            if(ok == 1)
            {
                ok1 = 1;
                break;
            }
        }
        if(ok1 == 0)
            return i;
    }
    return combo.size();
}
*/


string guess_sequence(int N)
{
    string b[] = {"A", "B", "X", "Y"};
    vector <string> b1;
    b1.clear();
    string pref = "";
    if(press("AX"))
    {
        if(press("A"))
            pref = "A";
        else
            pref = "X";
    }
    else
    {
        if(press("B"))
            pref = "B";
        else
            pref = "Y";
    }
    for(int i = 0; i < 4; i++)
        if(b[i] != pref)
            b1.push_back(b[i]);
    for(int i = 1; i < N - 1; i++)
    {
        int q = press(pref + b1[0] + pref + b1[1] + b1[0] + pref + b1[1] + b1[1] + pref + b1[1] + b1[2]);
        if(q == pref.size())
            pref += b1[2];
        else if(q == pref.size() + 1)
            pref += b1[0];
        else
            pref += b1[1];
    }
    if(press(pref + b1[0] + pref + b1[1]) > pref.size())
    {
        if(press(pref + b1[0]) > pref.size())
            pref += b1[0];
        else
            pref += b1[1];
    }
    else
        pref += b1[2];
    return pref;
}
/*
int main()
{
    cin >> combo;
    cout << guess_sequence(combo.size());
    return 0;
}*/

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:62:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         if(q == pref.size())
      |            ~~^~~~~~~~~~~~~~
combo.cpp:64:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         else if(q == pref.size() + 1)
      |                 ~~^~~~~~~~~~~~~~~~~~
combo.cpp:69:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     if(press(pref + b1[0] + pref + b1[1]) > pref.size())
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
combo.cpp:71:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         if(press(pref + b1[0]) > pref.size())
      |            ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 95.0

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