# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348555 | 2021-01-15T08:04:45 Z | Halogen | Combo (IOI18_combo) | C++14 | 2 ms | 200 KB |
#include <bits/stdc++.h> #include "combo.h" using namespace std; std::string guess_sequence(int N) { vector<char> lst{'A', 'B', 'X', 'Y'}; std::string p = ""; if (press(p + lst[0] + p + lst[1]) >= p.size() + 1) { if (press(p + lst[0]) == p.size() + 1){ p += lst[0]; lst.erase(lst.begin() + 0); } else { p += lst[1]; lst.erase(lst.begin() + 1); } } else if (press(p + lst[2]) == p.size() + 1) { p += lst[2]; lst.erase(lst.begin() + 2); } else { p += lst[3]; lst.erase(lst.begin() + 3); } for (int j = 2; j < N; j++) { int result = press(p + lst[0] + p + lst[1] + lst[0] + p + lst[1] + lst[1] + p + lst[1] + lst[2]); if (result == j) p += lst[0]; else if (result == j + 1) p += lst[1]; else p += lst[2]; } if (press(p + lst[0] + p + lst[1]) != N) p += lst[2]; else if (press(p + lst[0]) == N) p += lst[0]; else p += lst[1]; return p; }
Compilation message
# | 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 | 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 | 2 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 | 2 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 | 2 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 | 1 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 | 0 ms | 200 KB | Output is correct |
25 | Correct | 1 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 | 2 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 | 0 ms | 200 KB | Output is correct |
35 | Correct | 0 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 | - |