# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79832 | 2018-10-16T17:17:37 Z | muradeyn | Combo (IOI18_combo) | C++14 | 2 ms | 276 KB |
#include "combo.h" #include <bits/stdc++.h> using namespace std; string guess_sequence(int N) { string res; vector<char>v; if (press("AB") >= 1) { if (press("A") == 1)res = "A"; else res = "B"; } else { if (press("X") == 1)res = "X"; else res = "Y"; } if (res[0] != 'X')v.push_back('X'); if (res[0] != 'Y')v.push_back('Y'); if (res[0] != 'A')v.push_back('A'); if (res[0] != 'B')v.push_back('B'); while (res.length() < N - 1) { string query = res + v[0] + res + v[1] + v[0] + res + v[1] + v[1] + res + v[1] + v[2]; //cout<<query<<endl; int val = press(query); //cout<<val<<endl; if (val == res.length()+2)res += v[1]; else if (val == res.length()+1)res += v[0]; else res += v[2]; } if (press(res + v[0]) == N)res += v[0]; else if (press(res + v[1]) == N)res += v[1]; else if (press(res + v[2]) == N)res += v[2]; 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 | 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 | 260 KB | Output is correct |
9 | Correct | 1 ms | 228 KB | Output is correct |
10 | Correct | 1 ms | 200 KB | Output is correct |
11 | Correct | 1 ms | 276 KB | Output is correct |
12 | Correct | 2 ms | 248 KB | Output is correct |
13 | Correct | 1 ms | 248 KB | Output is correct |
14 | Correct | 1 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 | 1 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 | 1 ms | 200 KB | Output is correct |
23 | Correct | 1 ms | 200 KB | Output is correct |
24 | Correct | 1 ms | 240 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 | 1 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 | - |