#include <iostream>
#include <set>
#include <vector>
using namespace std;
int press(string s);
string guess_sequence(int N) {
string ans;
int ab = press("AB");
if (ab == 0) {
int x = press("X");
if (x == 0)
ans += "Y";
else
ans += "X";
} else {
int a = press("A");
if (a == 0)
ans += "B";
else
ans += "A";
}
set<char> s = {'A', 'B', 'X', 'Y'};
s.erase(ans[0]);
vector<char> sv(s.begin(), s.end());
for (int i = 2; i < N; ++i) {
string a(ans), b(ans);
a.push_back(sv[0]);
b.push_back(sv[1]);
string a1(a), a2(a), a3(a);
a1.push_back(sv[0]);
a2.push_back(sv[1]);
a3.push_back(sv[2]);
int q = press(a1 + a2 + a3 + b);
if (q == i + 1)
ans.push_back(sv[0]);
if (q == i)
ans.push_back(sv[1]);
if (q == i - 1)
ans.push_back(sv[2]);
}
string a(ans), b(ans);
a.push_back(sv[0]);
int qa = press(a);
if (qa == N)
return a;
b.push_back(sv[1]);
int qb = press(b);
if (qb == N)
return b;
ans.push_back(sv[2]);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 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 |
0 ms |
200 KB |
Output is correct |
10 |
Correct |
1 ms |
276 KB |
Output is correct |
11 |
Correct |
1 ms |
200 KB |
Output is correct |
12 |
Correct |
1 ms |
200 KB |
Output is correct |
13 |
Correct |
0 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 |
0 ms |
200 KB |
Output is correct |
20 |
Correct |
0 ms |
200 KB |
Output is correct |
21 |
Correct |
0 ms |
200 KB |
Output is correct |
22 |
Correct |
0 ms |
200 KB |
Output is correct |
23 |
Correct |
0 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 |
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 |
0 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 |
0 ms |
200 KB |
Output is correct |
35 |
Correct |
1 ms |
200 KB |
Output is correct |
36 |
Correct |
1 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Wrong Answer: wrong guess. |
2 |
Halted |
0 ms |
0 KB |
- |