oj.uz

Submission #754129

# Submission time Handle Problem Language Result Execution time Memory
754129 2023-06-06T18:41:23 Z kirakaminski968 Combo (IOI18_combo) C++17
5 / 100
 1 ms 240 KB 
#include <bits/stdc++.h>
#include <combo.h>
using namespace std;
string guess_sequence(int N){
    string ask = "AB"; string now = "";
    char arr[4] = {'A','B','X','Y'};
    int ok = press(ask), used;
    if(ok == 2){
        now += 'A';
        used = 0;
    }
    else if(ok == 1){
        ask = "A";
        ok = press(ask);
        if(ok == 1) {now += 'A'; used = 0;}
        else {now += 'B'; used = 1;}
    }
    else{
        ask = "X";
        ok = press(ask);
        if(ok == 1) {now += 'X'; used = 2;}
        else {now += 'Y'; used = 3;}
    }
    int add;
    if(used == 0) add = 1;
    else add = 0;
    //cout << used << " " << add << "\n";
    for(int i = 1;i<=N-2;++i){
        string ask;
        string cur = now + arr[add];
        int newc = -1, newc2 = -1;
        for(int j = 0;j<4;++j){
            if(j != used){
                ask += cur+arr[j];
                if(newc == -1 && j != add) newc = j;
                else if(j != add) newc2 = j;
            }
        }
        ask += now+arr[newc];
        ok = press(ask);
        if(ok == i+2){
            now += arr[add];
        }
        else if(ok == i+1){
            now += arr[newc];
        }
        else{
            now += arr[newc2];
        }
    }
    for(int i = 0;i<4;++i){
        if(i != used){
            ok = press(now+arr[i]);
            if(ok == N){
                return now+arr[i];
            }
        }
    }
}

Compilation message

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:5:18: warning: control reaches end of non-void function [-Wreturn-type]
    5 |     string ask = "AB"; string now = "";
      |                  ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 95.0

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