# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
939359 | 2024-03-06T09:51:34 Z | ifateen | Combo (IOI18_combo) | C++14 | 1 ms | 344 KB |
#include <bits/stdc++.h> #include "combo.h" using namespace std; string guess_sequence(int N) { string ans; vector<string> possible = {"A", "B", "X", "Y"}; int idx = -1; for (int i = 0; i < possible.size() - 1; i++) { int ret = press(possible[i]); if (ret == 1) { ans += possible[i]; idx = i; break; } } if (ans.empty()) ans += "Y", idx = 3; swap(possible[idx], possible[3]); while (ans.size() < N - 1) { string query; query += ans; query += possible[1]; query += ans; query += possible[2]; query += possible[0]; query += ans; query += possible[2]; query += possible[1]; query += ans; query += possible[2]; query += possible[2]; int ret_value = press(query); if (ret_value == ans.size()) { // possible[0] ans += possible[0]; } else if (ret_value == ans.size() + 1) { // possible[1] ans += possible[1]; } else ans += possible[2]; } int zero = press(ans + possible[0]); if (zero == N) return ans + possible[0]; int one = press(ans + possible[1]); if (one == N) return ans + possible[1]; return ans + possible[2]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 1 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 344 KB | Output is correct |
11 | Correct | 0 ms | 344 KB | Output is correct |
12 | Correct | 0 ms | 344 KB | Output is correct |
13 | Correct | 0 ms | 344 KB | Output is correct |
14 | Correct | 0 ms | 344 KB | Output is correct |
15 | Correct | 0 ms | 344 KB | Output is correct |
16 | Correct | 0 ms | 344 KB | Output is correct |
17 | Correct | 0 ms | 344 KB | Output is correct |
18 | Correct | 0 ms | 344 KB | Output is correct |
19 | Correct | 0 ms | 344 KB | Output is correct |
20 | Correct | 0 ms | 344 KB | Output is correct |
21 | Correct | 0 ms | 344 KB | Output is correct |
22 | Correct | 0 ms | 344 KB | Output is correct |
23 | Correct | 1 ms | 344 KB | Output is correct |
24 | Correct | 1 ms | 344 KB | Output is correct |
25 | Correct | 0 ms | 344 KB | Output is correct |
26 | Correct | 0 ms | 344 KB | Output is correct |
27 | Correct | 0 ms | 344 KB | Output is correct |
28 | Correct | 0 ms | 344 KB | Output is correct |
29 | Correct | 0 ms | 344 KB | Output is correct |
30 | Correct | 0 ms | 344 KB | Output is correct |
31 | Correct | 1 ms | 344 KB | Output is correct |
32 | Correct | 1 ms | 344 KB | Output is correct |
33 | Correct | 1 ms | 344 KB | Output is correct |
34 | Correct | 1 ms | 344 KB | Output is correct |
35 | Correct | 0 ms | 344 KB | Output is correct |
36 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong Answer: wrong guess. |
2 | Halted | 0 ms | 0 KB | - |