# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
345875 |
2021-01-08T11:05:31 Z |
Alma |
Combo (IOI18_combo) |
C++14 |
|
1 ms |
248 KB |
#include <iostream>
#include <vector>
#include <string>
#include <combo.h>
using namespace std;
string guess_sequence(int N) {
// 100 points: N + 2 calls to "press"
string p = "";
string S = "";
vector<char> v = {};
int coins = 0;
// guess 1st letter of S (num of calls to "press" = 2)
p = "AB"; coins = press(p);
if (coins >= 1) {
p = "A"; coins = press(p);
if (coins == 1) {S = "A"; v = {'B', 'X', 'Y'};} // 1st letter = A
else {S = "B"; v = {'A', 'X', 'Y'};} // 1st letter = B
}
else {
p = "X"; coins = press(p);
if (coins == 1) {S = "X"; v = {'A', 'B', 'Y'};} // 1st letter = X
else {S = "Y"; v = {'A', 'B', 'X'};} // 1st letter = Y
}
// guess from 2nd letter to N-1 (num of calls to "press" = N-2)
for (int i = 1; i < N-1; i++) {
p = S + v[0]+v[0] + S + v[0]+v[1] + S + v[0]+v[2] + S + v[1];
// f.e. 1st = A p = S BB S BX S BY S X
coins = press(p);
if (coins == i+2) {S += v[0];} // next letter = B v[0]
else if (coins == i+1) {S += v[1];} // next letter = X v[1]
else {S += v[2];} // next letter = Y v[2]
}
// guess last letter of S (num of calls to "press" = 2)
p = S + v[0]; coins = press(p);
if (coins == N) {S += v[0];}
else {
p = S + v[1]; coins = press(p);
if (coins == N) {S += v[1];}
else {S += v[2];}
}
// total of calls to "press" = 2 + N-2 + 2 = N + 2
return S;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Correct |
0 ms |
200 KB |
Output is correct |
4 |
Correct |
0 ms |
200 KB |
Output is correct |
5 |
Correct |
1 ms |
200 KB |
Output is correct |
6 |
Correct |
0 ms |
200 KB |
Output is correct |
7 |
Correct |
0 ms |
200 KB |
Output is correct |
8 |
Correct |
0 ms |
200 KB |
Output is correct |
9 |
Correct |
0 ms |
200 KB |
Output is correct |
10 |
Correct |
1 ms |
200 KB |
Output is correct |
11 |
Correct |
0 ms |
200 KB |
Output is correct |
12 |
Correct |
0 ms |
200 KB |
Output is correct |
13 |
Correct |
0 ms |
200 KB |
Output is correct |
14 |
Correct |
1 ms |
200 KB |
Output is correct |
15 |
Correct |
0 ms |
200 KB |
Output is correct |
16 |
Correct |
0 ms |
200 KB |
Output is correct |
17 |
Correct |
0 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 |
0 ms |
248 KB |
Output is correct |
21 |
Correct |
1 ms |
200 KB |
Output is correct |
22 |
Correct |
0 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 |
0 ms |
200 KB |
Output is correct |
28 |
Correct |
1 ms |
200 KB |
Output is correct |
29 |
Correct |
0 ms |
200 KB |
Output is correct |
30 |
Correct |
1 ms |
200 KB |
Output is correct |
31 |
Correct |
0 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 |
0 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 |
- |