# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582720 | TimDee | Combo (IOI18_combo) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for (int i=0; i<n; ++i)
#define all(a) a.begin(), a.end()
#define pb(x) push_back(x)
std::string guess_sequence(int N) {
int n=N;
string s;
//forn(i,n) s+='*';
char f;
if (press("AB")) {
if (press("A")) {
f='A';
} else {
f='B';
}
} else {
if (press("X")) {
f='X';
} else {
f='Y';
}
}
vector<char> v;
if (f!='A') v.pb('A'); if (f!='B') v.pb('B'); if (f!='X') v.pb('X'); if (f!='Y') v.pb('Y');
s+=f;
vector<char> Or;
while (s.length()!=N) {
string p=s;
if (Or.size()) p+=Or[0];
p+=v[0];
p+=s;
if (Or.size()) p+=Or[0];
p+=v[1];
int x = press(p);
if (x==s.length() && x==p.length()/2-1) {
if (Or.size()) {
s+=Or[0];
Or.clear();
}
s+=v[2];
}
else if (x>s.length()){
if (Or.size()) s+=Or[0];
Or.clear();
Or.pb(v[0]);
Or.pb(v[1]);
} else {
s+=Or[1];
Or.clear();
}
}
return s;
}