oj.uz

Submission #971291

# Submission time Handle Problem Language Result Execution time Memory
971291 2024-04-28T10:53:21 Z codefox Combo (IOI18_combo) C++14
97 / 100
 25 ms 1908 KB 
#include<bits/stdc++.h>
#include "combo.h"

using namespace std;

array<char, 4> arr = {'A', 'B', 'Y', 'X'};

char unknown(string s, int j, char f)
{
    string ss;
    string sol;
    for (int i = 0; i < j; i++)
    {
        ss+=s[i];
    }
    if (f=='A')
    {
        sol = ss+'B';
        sol += ss+"XX";
        sol += ss+"XB";
        sol += ss+"XY";
        int c = press(sol);
        if (c==j) return 'Y';
        if (c==j+1) return 'B';
        else return 'X';
    }
    if (f=='B')
    {
        sol = ss+'A';
        sol += ss+"XX";
        sol += ss+"XA";
        sol += ss+"XY";
        int c = press(sol);
        if (c==j) return 'Y';
        if (c==j+1) return 'A';
        else return 'X';
    }
    if (f=='Y')
    {
        sol = ss+'A';
        sol += ss+"BX";
        sol += ss+"BB";
        sol += ss+"BA";
        int c = press(sol);
        if (c==j) return 'X';
        if (c==j+1) return 'A';
        else return 'B';
    }
    if (f=='X')
    {
        sol = ss+'B';
        sol += ss+"AA";
        sol += ss+"AB";
        sol += ss+"AY";
        int c = press(sol);
        if (c==j) return 'Y';
        if (c==j+1) return 'B';
        else return 'A';
    }
}

string guess_sequence(int N) {
    char f = 'N';
    for (int i = 0; i < 3; i++)
    {
        string st = "";
        st += arr[i];
        if (press(st))
        {
            f = arr[i];
            break;
        }
    }
    if (f=='N') f = 'X';
    if (N==1) 
    {
        string s = "";
        s+=f;
        return s;
    }

    string s = "";
    s += f;
    for (int i = 1; i < N-1; i++)
    {
        s += unknown(s, i, f);
    }
    if (f!='A' && press(s+'A')==N) return s+'A';
    if (f!='B' && press(s+'B')==N) return s+'B';
    if (f =='X') return s+'Y';
    if (f=='Y') return s+'X';
    if (press(s+'Y')==N) return s+'Y';
    else return s+'X';
}

Compilation message

combo.cpp: In function 'char unknown(std::string, int, char)':
combo.cpp:10:12: warning: control reaches end of non-void function [-Wreturn-type]
   10 |     string ss;
      |            ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 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 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 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 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 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 1 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 344 KB Output is correct
26 Correct 1 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 1 ms 344 KB Output is correct
30 Correct 1 ms 392 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
92.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 344 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 380 KB Output is correct
12 Partially correct 0 ms 344 KB Output is partially correct
13 Partially correct 0 ms 344 KB Output is partially correct
14 Correct 0 ms 344 KB Output is correct
15 Partially correct 0 ms 344 KB Output is partially correct
16 Partially correct 0 ms 344 KB Output is partially correct
17 Correct 16 ms 1412 KB Output is correct
18 Correct 16 ms 1828 KB Output is correct
19 Correct 16 ms 1284 KB Output is correct
20 Partially correct 15 ms 940 KB Output is partially correct
21 Partially correct 17 ms 1872 KB Output is partially correct
22 Correct 0 ms 344 KB Output is correct
23 Partially correct 0 ms 440 KB Output is partially correct
24 Correct 0 ms 440 KB Output is correct
25 Correct 1 ms 448 KB Output is correct
26 Correct 1 ms 448 KB Output is correct
27 Correct 1 ms 952 KB Output is correct
28 Correct 1 ms 1212 KB Output is correct
29 Partially correct 1 ms 440 KB Output is partially correct
30 Correct 1 ms 444 KB Output is correct
31 Partially correct 2 ms 440 KB Output is partially correct
32 Partially correct 15 ms 1156 KB Output is partially correct
33 Correct 15 ms 1728 KB Output is correct
34 Correct 16 ms 1324 KB Output is correct
35 Partially correct 15 ms 1724 KB Output is partially correct
36 Partially correct 15 ms 1248 KB Output is partially correct
37 Correct 16 ms 1336 KB Output is correct
38 Partially correct 16 ms 1440 KB Output is partially correct
39 Correct 17 ms 1464 KB Output is correct
40 Correct 15 ms 1348 KB Output is correct
41 Partially correct 16 ms 1480 KB Output is partially correct
42 Correct 18 ms 1444 KB Output is correct
43 Correct 17 ms 1536 KB Output is correct
44 Correct 15 ms 1012 KB Output is correct
45 Correct 15 ms 1196 KB Output is correct
46 Correct 17 ms 1476 KB Output is correct
47 Correct 17 ms 1376 KB Output is correct
48 Partially correct 16 ms 1480 KB Output is partially correct
49 Partially correct 15 ms 1020 KB Output is partially correct
50 Correct 16 ms 1492 KB Output is correct
51 Correct 16 ms 1248 KB Output is correct
52 Partially correct 15 ms 1772 KB Output is partially correct
53 Partially correct 16 ms 1652 KB Output is partially correct
54 Correct 15 ms 1348 KB Output is correct
55 Correct 16 ms 1272 KB Output is correct
56 Correct 15 ms 1252 KB Output is correct
57 Correct 15 ms 1200 KB Output is correct
58 Correct 16 ms 1884 KB Output is correct
59 Correct 17 ms 1616 KB Output is correct
60 Partially correct 19 ms 1788 KB Output is partially correct
61 Partially correct 15 ms 1548 KB Output is partially correct
62 Correct 17 ms 1864 KB Output is correct
63 Correct 17 ms 1252 KB Output is correct
64 Partially correct 16 ms 1028 KB Output is partially correct
65 Partially correct 15 ms 1908 KB Output is partially correct
66 Correct 17 ms 1172 KB Output is correct
67 Correct 17 ms 896 KB Output is correct
68 Partially correct 17 ms 1472 KB Output is partially correct
69 Correct 23 ms 1244 KB Output is correct
70 Correct 18 ms 1760 KB Output is correct
71 Correct 25 ms 1364 KB Output is correct
72 Correct 23 ms 1252 KB Output is correct
73 Partially correct 18 ms 1236 KB Output is partially correct
74 Correct 19 ms 1620 KB Output is correct
75 Correct 16 ms 1336 KB Output is correct
76 Partially correct 19 ms 1696 KB Output is partially correct
77 Correct 16 ms 1276 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Partially correct 0 ms 516 KB Output is partially correct
80 Correct 0 ms 344 KB Output is correct
81 Partially correct 0 ms 344 KB Output is partially correct
82 Partially correct 0 ms 344 KB Output is partially correct
83 Correct 1 ms 436 KB Output is correct
84 Correct 0 ms 440 KB Output is correct
85 Partially correct 0 ms 436 KB Output is partially correct
86 Correct 0 ms 432 KB Output is correct
87 Partially correct 1 ms 432 KB Output is partially correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 428 KB Output is correct
94 Partially correct 0 ms 436 KB Output is partially correct
95 Partially correct 1 ms 432 KB Output is partially correct
96 Correct 0 ms 432 KB Output is correct
97 Correct 1 ms 432 KB Output is correct
98 Partially correct 1 ms 436 KB Output is partially correct
99 Partially correct 1 ms 436 KB Output is partially correct
100 Correct 1 ms 432 KB Output is correct
101 Correct 1 ms 856 KB Output is correct
102 Correct 1 ms 432 KB Output is correct
103 Correct 1 ms 688 KB Output is correct
104 Correct 1 ms 436 KB Output is correct
105 Correct 0 ms 440 KB Output is correct
106 Partially correct 0 ms 432 KB Output is partially correct
107 Partially correct 0 ms 344 KB Output is partially correct
108 Correct 0 ms 344 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Partially correct 0 ms 344 KB Output is partially correct
111 Partially correct 0 ms 344 KB Output is partially correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 344 KB Output is correct
114 Partially correct 0 ms 344 KB Output is partially correct
115 Partially correct 0 ms 344 KB Output is partially correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 1 ms 436 KB Output is correct
118 Correct 0 ms 436 KB Output is correct
119 Partially correct 0 ms 436 KB Output is partially correct
120 Correct 1 ms 436 KB Output is correct
121 Correct 0 ms 436 KB Output is correct
122 Partially correct 1 ms 436 KB Output is partially correct
123 Partially correct 0 ms 432 KB Output is partially correct