# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336925 | 2020-12-17T10:32:40 Z | blue | Combo (IOI18_combo) | C++11 | 1 ms | 256 KB |
#include "combo.h" #include <iostream> #include <string> #include <vector> using namespace std; /*int press(string S) { cout << S << '\n'; int res; cin >> res; return res; }*/ string guess_sequence(int N) { string res; if(press("AB") >= 1) { res = (press("A") == 1 ? "A" : "B"); } else { res = (press("X") == 1 ? "X" : "Y"); } string query; int query_res; vector<string> C; for(string t: {"A", "B", "X", "Y"}) if(t != res) C.push_back(t); while(res.size() != N-1) { query.clear(); query += res + C[0]; query += res + C[1] + C[0]; query += res + C[1] + C[1]; query += res + C[1] + C[2]; query_res = press(query); if(query_res == res.size()) { res += C[2]; } else if(query_res == res.size() + 1) { res += C[0]; } else { res += C[1]; } } if(press(res + C[0] + res + C[1]) == res.size()) { res += C[2]; } else { if(press(res + C[0]) == res.size() + 1) { res += C[0]; } else { res += C[1]; } } return res; }
Compilation message
# | 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 | 1 ms | 200 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 208 KB | Output is correct |
6 | Correct | 0 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 | 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 | 256 KB | Output is correct |
14 | Correct | 1 ms | 200 KB | Output is correct |
15 | Correct | 0 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 | 232 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 | 1 ms | 256 KB | Output is correct |
23 | Correct | 1 ms | 200 KB | Output is correct |
24 | Correct | 0 ms | 200 KB | Output is correct |
25 | Correct | 1 ms | 256 KB | Output is correct |
26 | Correct | 1 ms | 256 KB | Output is correct |
27 | Correct | 1 ms | 256 KB | Output is correct |
28 | Correct | 1 ms | 236 KB | Output is correct |
29 | Correct | 0 ms | 200 KB | Output is correct |
30 | Correct | 1 ms | 256 KB | Output is correct |
31 | Correct | 1 ms | 200 KB | Output is correct |
32 | Correct | 1 ms | 200 KB | Output is correct |
33 | Correct | 1 ms | 248 KB | Output is correct |
34 | Correct | 1 ms | 200 KB | Output is correct |
35 | Correct | 1 ms | 236 KB | Output is correct |
36 | Correct | 0 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 200 KB | Wrong Answer: invalid press |
2 | Halted | 0 ms | 0 KB | - |