# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
82749 |
2018-11-01T14:54:41 Z |
hugo_pm |
Combo (IOI18_combo) |
C++17 |
|
2 ms |
248 KB |
#include "combo.h"
#include <iostream>
using namespace std;
string S;
int N;
char ff;
string cc = "ABXY";
string test = "";
string guess_sequence(int locN)
{
N = locN;
int a1 = press("AB");
if (a1 == 0) {
int a2 = press("X");
if (a2 == 0) S.push_back('Y');
else S.push_back('X');
} else {
int a2 = press("A");
if (a2 == 0) S.push_back('B');
else S.push_back('A');
}
for (char c : cc) if (c != S[0]) test.push_back(c);
for (int i = 1; i < N-1; ++i) {
string p;
p.append(S);
p.push_back(test[0]);
for (char c : test) {
p.append(S);
p.push_back(test[1]);
p.push_back(c);
}
int cc = press(p);
if (cc == i) {
S.push_back(test[2]);
} else if (cc == i+1) {
S.push_back(test[0]);
} else {
S.push_back(test[1]);
}
}
for (char c : test) {
int x = press(S + c);
if (x == N) { S.push_back(c); break; }
}
return S;
}
# |
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 |
2 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 |
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 |
220 KB |
Output is correct |
21 |
Correct |
1 ms |
212 KB |
Output is correct |
22 |
Correct |
1 ms |
200 KB |
Output is correct |
23 |
Correct |
1 ms |
200 KB |
Output is correct |
24 |
Correct |
2 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 |
248 KB |
Output is correct |
28 |
Correct |
1 ms |
232 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 |
- |