Submission #345887

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
345887	2021-01-08T11:58:56 Z	Alma	Combo (IOI18_combo)	C++14	5 / 100	2 ms	256 KB

combo

#include <iostream>
#include <vector>
#include <string>
#include <combo.h>
using namespace std;

string guess_sequence(int N) {

    // 100 points: N + 2 calls to "press"
    string p = "";
    string S = "";
    vector<string> v = {};
    int coins = 0;

    // guess 1st letter of S (num of calls to "press" = 2)
    p = "AB"; coins = press(p);
    if (coins >= 1) {
        p = "A"; coins = press(p);
        if (coins == 1) {S = "A"; v = {"B", "X", "Y"};}  // 1st letter = A
        else {S = "B"; v = {"A", "X", "Y"};}             // 1st letter = B
    }
    else {
        p = "X"; coins = press(p);
        if (coins == 1) {S = "X"; v = {"A", "B", "Y"};}  // 1st letter = X
        else {S = "Y"; v = {"A", "B", "X"};}             // 1st letter = Y
    }

    // guess from 2nd letter to N-1 (num of calls to "press" = N-2)
    while (S.length() < N-1) {
        int i = 1;
        p = S + v[0]+v[0] + S + v[0]+v[1] + S + v[0]+v[2] + S + v[1];
        // f.e. 1st = A      p = SBB SBX SBY SX
        
        coins = press(p);
        if (coins == i+2) {S += v[0];}        // next letter = B  v[0]
        else if (coins == i+1) {S += v[1];}   // next letter = X  v[1]
        else {S += v[2];}                     // next letter = Y  v[2]
        i++;
    }

    // guess last letter of S (num of calls to "press" = 2)
    p = S + v[0]; coins = press(p);
    if (coins == N) {S += v[0];}
    else {
        p = S + v[1]; coins = press(p);
        if (coins == N) {S += v[1];}
        else {S += v[2];}
    }

    // total of calls to "press" = 2 + N-2 + 2 = (N + 2)
    return S;
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:29:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |     while (S.length() < N-1) {
      |            ~~~~~~~~~~~^~~~~

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	256 KB	Output is correct
3	Correct	1 ms	200 KB	Output is correct
4	Correct	1 ms	200 KB	Output is correct
5	Correct	2 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	2 ms	200 KB	Output is correct
9	Correct	1 ms	200 KB	Output is correct
10	Correct	1 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	0 ms	200 KB	Output is correct
17	Correct	0 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	200 KB	Output is correct
21	Correct	0 ms	200 KB	Output is correct
22	Correct	2 ms	200 KB	Output is correct
23	Correct	1 ms	200 KB	Output is correct
24	Correct	1 ms	200 KB	Output is correct
25	Correct	1 ms	200 KB	Output is correct
26	Correct	1 ms	200 KB	Output is correct
27	Correct	0 ms	200 KB	Output is correct
28	Correct	1 ms	200 KB	Output is correct
29	Correct	0 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	0 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	-