# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75836 | 2018-09-11T09:52:37 Z | nvmdava | Combo (IOI18_combo) | C++17 | 2 ms | 256 KB |
#include "combo.h" #include <bits/stdc++.h> using namespace std; string s; char c[4]; string guess_sequence(int N) { int k; if(press("AB")){ if(press("A")){ c[0] = 'B'; c[1] = 'X'; c[2] = 'Y'; s = "A"; } else { c[0] = 'A'; c[1] = 'X'; c[2] = 'Y'; s = "B"; } } else { if(press("X")){ c[0] = 'B'; c[1] = 'A'; c[2] = 'Y'; s = "X"; } else { c[0] = 'B'; c[1] = 'X'; c[2] = 'A'; s = "Y"; } } for(int i = 2; i < N; i++){ k =press(s + c[0] + c[1] + s + c[0] + c[0] + s + c[0] + c[2] + s + c[1]); if(k == s.size() + 2){ s += c[0]; } else if(k == s.size() + 1){ s += c[1]; } else { s += c[2]; } } if(press(s + c[0]) == N){ s += c[0]; } else { if(press(s + c[1]) == N){ s += c[1]; } else { s += c[2]; } } return s; }
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 | 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 | 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 | 1 ms | 200 KB | Output is correct |
17 | Correct | 1 ms | 256 KB | Output is correct |
18 | Correct | 1 ms | 200 KB | Output is correct |
19 | Correct | 1 ms | 200 KB | Output is correct |
20 | Correct | 2 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 | 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 | 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 | 256 KB | Wrong Answer: wrong guess. |
2 | Halted | 0 ms | 0 KB | - |