| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 158117 |
2019-10-14T21:27:41 Z |
johutha |
Combo (IOI18_combo) |
C++14 |
|
2 ms |
264 KB |
#include "combo.h"
#include <vector>
using namespace std;
string guess_sequence(int N)
{
string curr = "";
string other;
if (press("AB"))
{
if (press("A"))
{
curr.push_back('A');
other = "BXY";
}
else
{
curr.push_back('B');
other = "AXY";
}
}
else
{
if (press("X"))
{
curr.push_back('X');
other = "ABY";
}
else
{
curr.push_back('Y');
other = "ABX";
}
}
for (int i = 1; i < N - 1; i++)
{
string ask = curr + other[0] + curr + other[1] + other[0] + curr + other[1] + other[1] + curr + other[1] + other[2];
int res = press(ask);
if (res == i)
{
curr.push_back(other[2]);
}
else if (res == i + 1)
{
curr.push_back(other[0]);
}
else
{
curr.push_back(other[1]);
}
}
if (press(curr + other[0] + curr + other[1]) != N)
{
return curr + other[2];
}
else if (press(curr + other[0]) == N) return curr + other[0];
return curr + other[1];
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
200 KB |
Output is correct |
| 2 |
Correct |
1 ms |
200 KB |
Output is correct |
| 3 |
Correct |
2 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 |
252 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 |
2 ms |
200 KB |
Output is correct |
| 16 |
Correct |
1 ms |
200 KB |
Output is correct |
| 17 |
Correct |
2 ms |
200 KB |
Output is correct |
| 18 |
Correct |
1 ms |
200 KB |
Output is correct |
| 19 |
Correct |
2 ms |
200 KB |
Output is correct |
| 20 |
Correct |
1 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 |
212 KB |
Output is correct |
| 24 |
Correct |
1 ms |
200 KB |
Output is correct |
| 25 |
Correct |
2 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 |
1 ms |
200 KB |
Output is correct |
| 32 |
Correct |
2 ms |
200 KB |
Output is correct |
| 33 |
Correct |
1 ms |
200 KB |
Output is correct |
| 34 |
Correct |
1 ms |
264 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 |
- |
