#include <bits/stdc++.h>
// #include "grader.cpp"
#include "combo.h"
#define pb push_back
#define sz(s) (int)s.size()
using namespace std;
char c[] = {'A', 'B', 'X', 'Y'};
int ask(string s) {
return press(s);
}
string guess_sequence(int N) {
string ans;
if (ask("AB"))
if (ask("A"))
ans.pb('A');
else
ans.pb('B');
else
if (ask("X"))
ans.pb('X');
else
ans.pb('Y');
vector < char > vec;
for (int i = 0; i < 4; i++) {
if (c[i] == ans[0])
continue;
vec.pb(c[i]);
}
for (int i = 1; i < N - 1; i++) {
int temp = ask(ans + vec[0] + vec[0] + ans + vec[0] + vec[1] + ans + vec[0] + vec[2] + ans + vec[1]);
if (temp == sz(ans)) {
ans.pb(vec[2]);
} else if (temp == sz(ans) + 1) {
ans.pb(vec[1]);
} else {
ans.pb(vec[0]);
}
}
if (ask(ans + vec[0]) == N)
ans.pb(vec[0]);
else if (ask(ans + vec[1]) == N)
ans.pb(vec[1]);
else
ans.pb(vec[2]);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
2 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 |
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 |
1 ms |
268 KB |
Output is correct |
17 |
Correct |
1 ms |
248 KB |
Output is correct |
18 |
Correct |
1 ms |
200 KB |
Output is correct |
19 |
Correct |
1 ms |
244 KB |
Output is correct |
20 |
Correct |
1 ms |
200 KB |
Output is correct |
21 |
Correct |
1 ms |
240 KB |
Output is correct |
22 |
Correct |
1 ms |
200 KB |
Output is correct |
23 |
Correct |
2 ms |
200 KB |
Output is correct |
24 |
Correct |
2 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 |
256 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
Wrong Answer: wrong guess. |
2 |
Halted |
0 ms |
0 KB |
- |