# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
331615 |
2020-11-29T07:56:19 Z |
Falcon |
Combo (IOI18_combo) |
C++17 |
|
1 ms |
248 KB |
#include "combo.h"
#include <iostream>
#include <cassert>
std::string guess_sequence(int N) {
std::string p = "";
for(const char c : std::string("ABX")) {
p += c;
if(press(p)) break;
else p = "";
}
if(p.empty()) p = "Y";
std::string chars = "";
for(const char c : std::string("ABXY"))
if(c && c != p[0])
chars += c;
for(int i = 1; i < N - 1; ++i) {
std::string a, b, c, d;
a = p + chars[0];
b = p + chars[1] + chars[0];
c = p + chars[1] + chars[1];
d = p + chars[1] + chars[2];
switch(press(a + b + c + d) - i) {
case 0:
p += chars[2];
break;
case 1:
p += chars[0];
break;
case 2:
p += chars[1];
break;
default:
assert(0);
}
}
for(const char c : chars)
if(c != chars[0] && press(p + c) == N) {
p += c;
break;
}
if(int(p.size()) == N - 1) p += chars[0];
return p;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
0 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 |
0 ms |
200 KB |
Output is correct |
6 |
Correct |
1 ms |
200 KB |
Output is correct |
7 |
Correct |
0 ms |
200 KB |
Output is correct |
8 |
Correct |
0 ms |
200 KB |
Output is correct |
9 |
Correct |
1 ms |
200 KB |
Output is correct |
10 |
Correct |
0 ms |
200 KB |
Output is correct |
11 |
Correct |
0 ms |
200 KB |
Output is correct |
12 |
Correct |
0 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 |
0 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 |
1 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 |
0 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 |
1 ms |
200 KB |
Output is correct |
33 |
Correct |
0 ms |
200 KB |
Output is correct |
34 |
Correct |
1 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 |
248 KB |
Wrong Answer: wrong guess. |
2 |
Halted |
0 ms |
0 KB |
- |