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>
#define f first
#define s second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
int press(string p);
string c[4];
vector<string> v;
string guess_sequence(int N){
string s="";
c[0]="A";
c[1]="B";
c[2]="X";
c[3]="Y";
int pos=-1;
for(int i=0;i<3;i++){
int a=press(c[i]);
if(a==1){
s+=c[i];
pos=i;
break;
}
}
if(pos==-1){
s+=c[3];
pos=3;
}
for(int i=0;i<4;i++)if(pos!=i)v.push_back(c[i]);
for(int i=1;i<N;i++){
stringstream ss;
ss<<s<<v[0]<<s<<v[1]<<v[0]<<s<<v[1]<<v[1]<<s<<v[1]<<v[2];
int a=press(ss.str());
if(a==(int)s.size()+1)s+=v[0];
else if(a==(int)s.size()+2)s+=v[1];
else s+=v[2];
}
return s;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |