# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
348350 |
2021-01-14T17:39:09 Z |
NachoLibre |
Combo (IOI18_combo) |
C++14 |
|
2 ms |
200 KB |
#include <bits/stdc++.h>
using namespace std;
#ifdef wambule
int press(string) {
return 0;
}
#else
#include "combo.h"
#endif
string s = "";
int ask(vector<string> v) {
assert(v.size() < 5);
string c = "";
for(string t : v) {
c += s + t;
}
return press(c) - s.size();
}
string guess_sequence(int n) {
s = "";
string c[] = {"X", "Y", "A", "B"};
if(!ask({c[0], c[1]})) {
swap(c[0], c[2]);
swap(c[1], c[3]);
}
if(!ask({c[0]})) swap(c[0], c[1]);
s = c[0];
swap(c[0], c[3]);
for(int i = 2; i < n; ++i) {
int x = ask({c[0] + c[0], c[0] + c[1], c[0] + c[2], c[1]});
if(x == 2) {
s += c[0];
} else if(x == 1) {
s += c[1];
} else {
s += c[2];
}
}
if(ask({c[0]})) s += c[0];
else if(ask({c[1]})) s += c[1];
else s += c[2];
return s;
}
#ifdef wambule
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
return 0;
}
#endif
# |
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 |
2 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 |
2 ms |
200 KB |
Output is correct |
17 |
Correct |
1 ms |
200 KB |
Output is correct |
18 |
Correct |
0 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 |
1 ms |
200 KB |
Output is correct |
25 |
Correct |
0 ms |
200 KB |
Output is correct |
26 |
Correct |
0 ms |
200 KB |
Output is correct |
27 |
Correct |
1 ms |
200 KB |
Output is correct |
28 |
Correct |
0 ms |
200 KB |
Output is correct |
29 |
Correct |
1 ms |
200 KB |
Output is correct |
30 |
Correct |
0 ms |
200 KB |
Output is correct |
31 |
Correct |
0 ms |
200 KB |
Output is correct |
32 |
Correct |
0 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 |
0 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 |
- |