# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
884468 |
2023-12-07T12:21:16 Z |
gustavo_d |
Combo (IOI18_combo) |
C++17 |
|
14 ms |
1792 KB |
// https://oj.uz/problem/view/IOI18_combo > p152
#include "combo.h"
#include <bits/stdc++.h>
using namespace std;
/*
botões A,B,X,Y no jogo, você pode fazer combos apertando + de um juntos
tem uma sequência secreta S de N chars
primeiro char dela nunca repete, bruta A, B, C, D (AABB, CCDD > o que for, você tenta um e se n é o outro; custo 3) > sobra 3 possibilidades pro resto; sendo A, ABAC se n for é o AD, se não tenta tipo AB se nao for é o AC (custo 2n-2)
você deve digitar até 4N chars, sua pontuação é o tamanho do maior prefixo de S que é substring da sequência sua
após o mínimo de combos 4N, você deve descobrir S
custo total: 2n-2+2 = 2n
pode chamar press com 0 a 4N chars até 8000 vezes e N até 2000
q<=N+2
O(n)
primeira: 4 chamadas, testa primeiro char
2N: só sobra 3 possibilidades pra cada char (primeiro não repete), aí vocẽ testa primeiro com segundo se for, testa 1 se não for é o outro; se não é os 2, é o 3o
*/
string guess_sequence(int N) {
string S = "";
string p = "AB";
int coins = press(p);
if (coins == 0) { // ou X out Y
p = "X";
coins = press(p);
if (coins == 0) S = "Y";
else S = "X";
} else {
p = "A";
coins = press(p);
if (coins == 0) S = "B";
else S = "A";
}
vector<char> others;
if ('A' != S[0]) others.push_back('A');
if ('B' != S[0]) others.push_back('B');
if ('X' != S[0]) others.push_back('X');
if ('Y' != S[0]) others.push_back('Y');
for (int i = 0; i < N-1; i++) {
p = "" + S;
p += others[0];
p += S;
p += others[1];
if (i < N-2) {
p += others[0];
p += S; p += others[1]; p += others[1];
p += S; p += others[1]; p += others[2];
coins = press(p);
if (coins == (int)S.size() + 1) S += others[0];
else if (coins == (int)S.size() + 2) S += others[1];
else S += others[2];
} else {
coins = press(p);
if (coins == (int)S.size()) S += others[2]; // sem query extra descobre
else { // precisa já na primeira descobrir se é o primeiro ou o segundo char (se der no segundo char coloca a combinação dos 3 chars depois além dele) >> 4N dá sempre
p = "" + S;
p += others[0];
coins = press(p);
if (coins == (int)S.size()) S += others[1];
else S += others[0];
}
}
}
return S;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
344 KB |
Output is correct |
15 |
Correct |
0 ms |
344 KB |
Output is correct |
16 |
Correct |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
0 ms |
344 KB |
Output is correct |
18 |
Correct |
0 ms |
344 KB |
Output is correct |
19 |
Correct |
0 ms |
344 KB |
Output is correct |
20 |
Correct |
0 ms |
344 KB |
Output is correct |
21 |
Correct |
0 ms |
344 KB |
Output is correct |
22 |
Correct |
0 ms |
344 KB |
Output is correct |
23 |
Correct |
0 ms |
344 KB |
Output is correct |
24 |
Correct |
0 ms |
344 KB |
Output is correct |
25 |
Correct |
0 ms |
344 KB |
Output is correct |
26 |
Correct |
0 ms |
344 KB |
Output is correct |
27 |
Correct |
0 ms |
340 KB |
Output is correct |
28 |
Correct |
0 ms |
344 KB |
Output is correct |
29 |
Correct |
1 ms |
344 KB |
Output is correct |
30 |
Correct |
0 ms |
344 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
33 |
Correct |
1 ms |
596 KB |
Output is correct |
34 |
Correct |
0 ms |
344 KB |
Output is correct |
35 |
Correct |
1 ms |
344 KB |
Output is correct |
36 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
1 ms |
344 KB |
Output is correct |
17 |
Correct |
12 ms |
1192 KB |
Output is correct |
18 |
Correct |
12 ms |
1192 KB |
Output is correct |
19 |
Correct |
11 ms |
1392 KB |
Output is correct |
20 |
Correct |
12 ms |
1608 KB |
Output is correct |
21 |
Correct |
11 ms |
1476 KB |
Output is correct |
22 |
Correct |
1 ms |
344 KB |
Output is correct |
23 |
Correct |
1 ms |
436 KB |
Output is correct |
24 |
Correct |
0 ms |
432 KB |
Output is correct |
25 |
Correct |
1 ms |
692 KB |
Output is correct |
26 |
Correct |
1 ms |
448 KB |
Output is correct |
27 |
Correct |
1 ms |
440 KB |
Output is correct |
28 |
Correct |
1 ms |
704 KB |
Output is correct |
29 |
Correct |
1 ms |
440 KB |
Output is correct |
30 |
Correct |
1 ms |
956 KB |
Output is correct |
31 |
Correct |
1 ms |
692 KB |
Output is correct |
32 |
Correct |
12 ms |
1224 KB |
Output is correct |
33 |
Correct |
13 ms |
1568 KB |
Output is correct |
34 |
Correct |
11 ms |
1532 KB |
Output is correct |
35 |
Correct |
10 ms |
892 KB |
Output is correct |
36 |
Correct |
13 ms |
1352 KB |
Output is correct |
37 |
Correct |
10 ms |
1144 KB |
Output is correct |
38 |
Correct |
12 ms |
1516 KB |
Output is correct |
39 |
Correct |
11 ms |
1204 KB |
Output is correct |
40 |
Correct |
14 ms |
1792 KB |
Output is correct |
41 |
Correct |
10 ms |
1280 KB |
Output is correct |
42 |
Correct |
11 ms |
1248 KB |
Output is correct |
43 |
Correct |
10 ms |
1336 KB |
Output is correct |
44 |
Correct |
13 ms |
1332 KB |
Output is correct |
45 |
Correct |
11 ms |
1704 KB |
Output is correct |
46 |
Correct |
14 ms |
1088 KB |
Output is correct |
47 |
Correct |
10 ms |
1356 KB |
Output is correct |
48 |
Correct |
11 ms |
1744 KB |
Output is correct |
49 |
Correct |
12 ms |
1044 KB |
Output is correct |
50 |
Correct |
13 ms |
1344 KB |
Output is correct |
51 |
Correct |
11 ms |
1028 KB |
Output is correct |
52 |
Correct |
11 ms |
1540 KB |
Output is correct |
53 |
Correct |
11 ms |
1392 KB |
Output is correct |
54 |
Correct |
11 ms |
1456 KB |
Output is correct |
55 |
Correct |
11 ms |
1252 KB |
Output is correct |
56 |
Correct |
11 ms |
1292 KB |
Output is correct |
57 |
Correct |
10 ms |
1408 KB |
Output is correct |
58 |
Correct |
12 ms |
1088 KB |
Output is correct |
59 |
Correct |
11 ms |
1156 KB |
Output is correct |
60 |
Correct |
11 ms |
1484 KB |
Output is correct |
61 |
Correct |
12 ms |
1384 KB |
Output is correct |
62 |
Correct |
10 ms |
1476 KB |
Output is correct |
63 |
Correct |
10 ms |
1136 KB |
Output is correct |
64 |
Correct |
11 ms |
1352 KB |
Output is correct |
65 |
Correct |
12 ms |
1100 KB |
Output is correct |
66 |
Correct |
12 ms |
1160 KB |
Output is correct |
67 |
Correct |
13 ms |
1276 KB |
Output is correct |
68 |
Correct |
10 ms |
1288 KB |
Output is correct |
69 |
Correct |
11 ms |
972 KB |
Output is correct |
70 |
Correct |
13 ms |
1224 KB |
Output is correct |
71 |
Correct |
11 ms |
1648 KB |
Output is correct |
72 |
Correct |
11 ms |
1624 KB |
Output is correct |
73 |
Correct |
10 ms |
1392 KB |
Output is correct |
74 |
Correct |
12 ms |
1276 KB |
Output is correct |
75 |
Correct |
11 ms |
1404 KB |
Output is correct |
76 |
Correct |
12 ms |
1088 KB |
Output is correct |
77 |
Correct |
12 ms |
1372 KB |
Output is correct |
78 |
Correct |
0 ms |
344 KB |
Output is correct |
79 |
Correct |
1 ms |
344 KB |
Output is correct |
80 |
Correct |
1 ms |
344 KB |
Output is correct |
81 |
Correct |
0 ms |
344 KB |
Output is correct |
82 |
Correct |
0 ms |
344 KB |
Output is correct |
83 |
Correct |
0 ms |
344 KB |
Output is correct |
84 |
Correct |
0 ms |
344 KB |
Output is correct |
85 |
Correct |
0 ms |
436 KB |
Output is correct |
86 |
Correct |
0 ms |
432 KB |
Output is correct |
87 |
Correct |
0 ms |
600 KB |
Output is correct |
88 |
Correct |
0 ms |
344 KB |
Output is correct |
89 |
Correct |
0 ms |
344 KB |
Output is correct |
90 |
Correct |
0 ms |
344 KB |
Output is correct |
91 |
Correct |
0 ms |
344 KB |
Output is correct |
92 |
Correct |
1 ms |
344 KB |
Output is correct |
93 |
Correct |
0 ms |
344 KB |
Output is correct |
94 |
Correct |
0 ms |
596 KB |
Output is correct |
95 |
Correct |
1 ms |
432 KB |
Output is correct |
96 |
Correct |
1 ms |
436 KB |
Output is correct |
97 |
Correct |
1 ms |
432 KB |
Output is correct |
98 |
Correct |
1 ms |
432 KB |
Output is correct |
99 |
Correct |
0 ms |
432 KB |
Output is correct |
100 |
Correct |
1 ms |
436 KB |
Output is correct |
101 |
Correct |
0 ms |
436 KB |
Output is correct |
102 |
Correct |
0 ms |
436 KB |
Output is correct |
103 |
Correct |
1 ms |
436 KB |
Output is correct |
104 |
Correct |
1 ms |
432 KB |
Output is correct |
105 |
Correct |
1 ms |
344 KB |
Output is correct |
106 |
Correct |
0 ms |
344 KB |
Output is correct |
107 |
Correct |
0 ms |
344 KB |
Output is correct |
108 |
Correct |
0 ms |
344 KB |
Output is correct |
109 |
Correct |
0 ms |
344 KB |
Output is correct |
110 |
Correct |
0 ms |
344 KB |
Output is correct |
111 |
Correct |
0 ms |
344 KB |
Output is correct |
112 |
Correct |
1 ms |
344 KB |
Output is correct |
113 |
Correct |
0 ms |
344 KB |
Output is correct |
114 |
Correct |
0 ms |
344 KB |
Output is correct |
115 |
Correct |
0 ms |
344 KB |
Output is correct |
116 |
Correct |
1 ms |
344 KB |
Output is correct |
117 |
Correct |
0 ms |
344 KB |
Output is correct |
118 |
Correct |
1 ms |
344 KB |
Output is correct |
119 |
Correct |
1 ms |
436 KB |
Output is correct |
120 |
Correct |
0 ms |
436 KB |
Output is correct |
121 |
Correct |
0 ms |
436 KB |
Output is correct |
122 |
Correct |
1 ms |
684 KB |
Output is correct |
123 |
Correct |
0 ms |
688 KB |
Output is correct |