# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
338223 |
2020-12-22T18:45:10 Z |
markussie |
Combo (IOI18_combo) |
C++17 |
|
1 ms |
200 KB |
#include "combo.h"
#include <vector>
#include <algorithm>
std::string guess_sequence(int N)
{
using std::string;
using std::vector;
string res;
if(press("AB"))
if(press("A"))
res = "A";
else
res = "B";
else
if(press("X"))
res = "X";
else
res = "Y";
vector<char> avail{'A', 'B', 'X', 'Y'};
avail.erase(std::find(avail.begin(), avail.end(), res[0]));
for(int i = 1; i < N-1; ++i)
{
int type = press(res + avail[0] + res + avail[1] + avail[0] + res + avail[1] + avail[1] + res + avail[1] + avail[2]) - res.size();
if(type == 0)
res += avail[2];
else
if(type == 1)
res += avail[0];
else
res += avail[1];
}
int type = press(res + avail[0]) - res.size();
if(type == 0)
if(press(res + avail[1]) - res.size())
res += avail[1];
else
res += avail[2];
else
res += avail[0];
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Correct |
0 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 |
0 ms |
200 KB |
Output is correct |
7 |
Correct |
0 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 |
0 ms |
200 KB |
Output is correct |
13 |
Correct |
1 ms |
200 KB |
Output is correct |
14 |
Correct |
0 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 |
1 ms |
200 KB |
Output is correct |
20 |
Correct |
0 ms |
200 KB |
Output is correct |
21 |
Correct |
1 ms |
200 KB |
Output is correct |
22 |
Correct |
1 ms |
200 KB |
Output is correct |
23 |
Correct |
1 ms |
200 KB |
Output is correct |
24 |
Correct |
0 ms |
200 KB |
Output is correct |
25 |
Correct |
0 ms |
200 KB |
Output is correct |
26 |
Correct |
0 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 |
0 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 |
0 ms |
200 KB |
Output is correct |
34 |
Correct |
0 ms |
200 KB |
Output is correct |
35 |
Correct |
0 ms |
200 KB |
Output is correct |
36 |
Correct |
0 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 |
- |