# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
82787 |
2018-11-01T16:32:17 Z |
314rate |
Combo (IOI18_combo) |
C++14 |
|
2 ms |
256 KB |
#include <combo.h>
#include <bits/stdc++.h>
using namespace std;
string guess_sequence (int n)
{
string ans;
if (press ("AB"))
{
if (press ("A"))
{
ans = "A";
}
else
{
ans = "B";
}
}
else
{
if (press ("X"))
{
ans = "X";
}
else
{
ans = "Y";
}
}
vector<string>ch;
if (ans[0] != 'A') ch.push_back ("A");
if (ans[0] != 'B') ch.push_back ("B");
if (ans[0] != 'X') ch.push_back ("X");
if (ans[0] != 'Y') ch.push_back ("Y");
for (int i = 1; i <= n - 2; i++)
{
string ask;
ask += ans + (ch[2] + ch[0]);
ask += ans + (ch[2] + ch[1]);
ask += ans + (ch[2] + ch[2]);
ask += ans + (ch[1]);
int value = press (ask) - i;
ans += ch[value];
}
if (press (ans + ch[0]) == n)
{
ans += ch[0];
}
else
{
if (press (ans + ch[1]) == n)
{
ans += ch[1];
}
else
{
ans += ch[2];
}
}
return ans;
}
# |
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 |
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 |
200 KB |
Output is correct |
10 |
Correct |
1 ms |
240 KB |
Output is correct |
11 |
Correct |
1 ms |
200 KB |
Output is correct |
12 |
Correct |
2 ms |
256 KB |
Output is correct |
13 |
Correct |
1 ms |
200 KB |
Output is correct |
14 |
Correct |
2 ms |
200 KB |
Output is correct |
15 |
Correct |
1 ms |
252 KB |
Output is correct |
16 |
Correct |
1 ms |
256 KB |
Output is correct |
17 |
Correct |
1 ms |
200 KB |
Output is correct |
18 |
Correct |
2 ms |
200 KB |
Output is correct |
19 |
Correct |
1 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 |
2 ms |
200 KB |
Output is correct |
23 |
Correct |
2 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 |
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 |
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 |
- |