#include "combo.h"
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
using tint = long long;
using ld = long double;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
using pi = pair<tint,tint>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define ins insert
#define f first
#define s second
#define mp make_pair
#define DBG(x) cerr << #x << " = " << x << endl;
const int MOD = 1e9+7;
const int mod = 998244353;
const int MX = 1005;
const tint INF = 1e18;
const int inf = 2e9;
const ld PI = acos(ld(-1));
const ld eps = 1e-8;
const int dx[4] = {0, 0, -1, 1};
const int dy[4] = {1, -1, 0, 0};
template<class T> void remDup(vector<T> &v){
sort(all(v)); v.erase(unique(all(v)),end(v));
}
bool valid(int x, int y, int n, int m){
return (0<=x && x<n && 0<=y && y<m);
}
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
void NACHO(string name = "lightson"){
ios_base::sync_with_stdio(0); cin.tie(0);
//freopen((name+".in").c_str(), "r", stdin);
//freopen((name+".out").c_str(), "w", stdout);
}
std::string guess_sequence(int N) {
//sea s la respuesta que tenes hasta ahira
//si preguntas s+un caracter
// lo podes adivinar en a lo sumo 2 queries
// queremos adivinar en una query (supongo que Y es el del comienzo)
// preguntas s+AB+s+AX+s+AA+s+B
// si nos da 2, el proximo es A
// si nos da 1, es B
// si nos da 0, es X
int q = press("A");
vector<string> p;
string s;
if(q){
p = {"X", "Y", "B"};
s = "A";
}else{
q = press("X");
if(q){
p = {"A", "Y", "B"};
s = "X";
}else{
q = press("Y");
if(q){
p = {"A", "X", "B"};
s = "Y";
}else{
p = {"A", "Y", "X"};
s = "B";
}
}
}
F0R(i, N-2){
q = press(s+p[0]+p[0]+s+p[0]+p[1]+s+p[0]+p[2]+s+p[1]);
if(q == sz(s)){
s += p[2];
}else if(q == sz(s)+1){
s += p[1];
}else s += p[0];
}
if(N > 1){
q = press(s+p[0]);
if(q == sz(s)+1) s += p[0];
else{
q = press(s+p[1]);
if(q == sz(s)+1) s += p[1];
else s += p[2];
}
}
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 |
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 |
0 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 |
0 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 |
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 |
0 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 |
0 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 |
1 ms |
200 KB |
Output is correct |
31 |
Correct |
1 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 |
1 ms |
200 KB |
Output is correct |
# |
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 |
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 |
0 ms |
200 KB |
Output is correct |
8 |
Correct |
1 ms |
200 KB |
Output is correct |
9 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
10 |
Partially correct |
2 ms |
200 KB |
Output is partially 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 |
0 ms |
200 KB |
Output is correct |
15 |
Partially correct |
0 ms |
200 KB |
Output is partially correct |
16 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
17 |
Correct |
36 ms |
344 KB |
Output is correct |
18 |
Correct |
39 ms |
452 KB |
Output is correct |
19 |
Partially correct |
35 ms |
444 KB |
Output is partially correct |
20 |
Partially correct |
36 ms |
432 KB |
Output is partially correct |
21 |
Correct |
36 ms |
420 KB |
Output is correct |
22 |
Correct |
1 ms |
200 KB |
Output is correct |
23 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
24 |
Partially correct |
2 ms |
200 KB |
Output is partially correct |
25 |
Partially correct |
2 ms |
200 KB |
Output is partially correct |
26 |
Correct |
1 ms |
300 KB |
Output is correct |
27 |
Correct |
2 ms |
288 KB |
Output is correct |
28 |
Correct |
2 ms |
200 KB |
Output is correct |
29 |
Correct |
3 ms |
296 KB |
Output is correct |
30 |
Partially correct |
3 ms |
312 KB |
Output is partially correct |
31 |
Partially correct |
4 ms |
316 KB |
Output is partially correct |
32 |
Correct |
28 ms |
364 KB |
Output is correct |
33 |
Correct |
34 ms |
428 KB |
Output is correct |
34 |
Correct |
28 ms |
340 KB |
Output is correct |
35 |
Correct |
34 ms |
348 KB |
Output is correct |
36 |
Partially correct |
19 ms |
368 KB |
Output is partially correct |
37 |
Correct |
31 ms |
452 KB |
Output is correct |
38 |
Correct |
38 ms |
356 KB |
Output is correct |
39 |
Correct |
24 ms |
344 KB |
Output is correct |
40 |
Correct |
30 ms |
448 KB |
Output is correct |
41 |
Correct |
32 ms |
344 KB |
Output is correct |
42 |
Correct |
32 ms |
400 KB |
Output is correct |
43 |
Correct |
28 ms |
448 KB |
Output is correct |
44 |
Correct |
42 ms |
396 KB |
Output is correct |
45 |
Correct |
40 ms |
344 KB |
Output is correct |
46 |
Correct |
38 ms |
348 KB |
Output is correct |
47 |
Partially correct |
30 ms |
444 KB |
Output is partially correct |
48 |
Correct |
22 ms |
412 KB |
Output is correct |
49 |
Partially correct |
37 ms |
352 KB |
Output is partially correct |
50 |
Correct |
39 ms |
524 KB |
Output is correct |
51 |
Correct |
33 ms |
408 KB |
Output is correct |
52 |
Correct |
37 ms |
448 KB |
Output is correct |
53 |
Partially correct |
35 ms |
340 KB |
Output is partially correct |
54 |
Correct |
40 ms |
344 KB |
Output is correct |
55 |
Correct |
25 ms |
588 KB |
Output is correct |
56 |
Correct |
19 ms |
348 KB |
Output is correct |
57 |
Correct |
31 ms |
340 KB |
Output is correct |
58 |
Correct |
28 ms |
668 KB |
Output is correct |
59 |
Partially correct |
37 ms |
348 KB |
Output is partially correct |
60 |
Correct |
30 ms |
340 KB |
Output is correct |
61 |
Partially correct |
29 ms |
452 KB |
Output is partially correct |
62 |
Correct |
34 ms |
380 KB |
Output is correct |
63 |
Partially correct |
24 ms |
344 KB |
Output is partially correct |
64 |
Correct |
32 ms |
340 KB |
Output is correct |
65 |
Partially correct |
29 ms |
344 KB |
Output is partially correct |
66 |
Correct |
36 ms |
452 KB |
Output is correct |
67 |
Partially correct |
36 ms |
344 KB |
Output is partially correct |
68 |
Correct |
30 ms |
352 KB |
Output is correct |
69 |
Correct |
28 ms |
356 KB |
Output is correct |
70 |
Correct |
24 ms |
348 KB |
Output is correct |
71 |
Partially correct |
28 ms |
380 KB |
Output is partially correct |
72 |
Correct |
37 ms |
384 KB |
Output is correct |
73 |
Partially correct |
22 ms |
400 KB |
Output is partially correct |
74 |
Correct |
34 ms |
348 KB |
Output is correct |
75 |
Correct |
36 ms |
344 KB |
Output is correct |
76 |
Correct |
45 ms |
344 KB |
Output is correct |
77 |
Correct |
30 ms |
348 KB |
Output is correct |
78 |
Correct |
1 ms |
200 KB |
Output is correct |
79 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
80 |
Correct |
1 ms |
200 KB |
Output is correct |
81 |
Correct |
1 ms |
200 KB |
Output is correct |
82 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
83 |
Correct |
1 ms |
200 KB |
Output is correct |
84 |
Correct |
1 ms |
200 KB |
Output is correct |
85 |
Correct |
1 ms |
200 KB |
Output is correct |
86 |
Correct |
1 ms |
200 KB |
Output is correct |
87 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
88 |
Correct |
1 ms |
200 KB |
Output is correct |
89 |
Correct |
1 ms |
200 KB |
Output is correct |
90 |
Correct |
1 ms |
200 KB |
Output is correct |
91 |
Correct |
2 ms |
200 KB |
Output is correct |
92 |
Correct |
1 ms |
200 KB |
Output is correct |
93 |
Partially correct |
2 ms |
200 KB |
Output is partially correct |
94 |
Correct |
1 ms |
200 KB |
Output is correct |
95 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
96 |
Correct |
1 ms |
200 KB |
Output is correct |
97 |
Partially correct |
2 ms |
288 KB |
Output is partially correct |
98 |
Correct |
1 ms |
200 KB |
Output is correct |
99 |
Partially correct |
1 ms |
296 KB |
Output is partially correct |
100 |
Correct |
1 ms |
200 KB |
Output is correct |
101 |
Correct |
1 ms |
200 KB |
Output is correct |
102 |
Correct |
1 ms |
200 KB |
Output is correct |
103 |
Correct |
1 ms |
292 KB |
Output is correct |
104 |
Correct |
1 ms |
316 KB |
Output is correct |
105 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
106 |
Correct |
2 ms |
200 KB |
Output is correct |
107 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
108 |
Correct |
1 ms |
200 KB |
Output is correct |
109 |
Partially correct |
1 ms |
248 KB |
Output is partially correct |
110 |
Correct |
0 ms |
200 KB |
Output is correct |
111 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
112 |
Correct |
1 ms |
200 KB |
Output is correct |
113 |
Partially correct |
0 ms |
200 KB |
Output is partially correct |
114 |
Correct |
1 ms |
200 KB |
Output is correct |
115 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
116 |
Correct |
3 ms |
200 KB |
Output is correct |
117 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
118 |
Correct |
1 ms |
200 KB |
Output is correct |
119 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
120 |
Correct |
2 ms |
200 KB |
Output is correct |
121 |
Partially correct |
1 ms |
200 KB |
Output is partially correct |
122 |
Correct |
1 ms |
200 KB |
Output is correct |
123 |
Partially correct |
1 ms |
288 KB |
Output is partially correct |