# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82726 | 314rate | 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;
/**string ans="ABXYY";
int cnt=0;
**/
/**int press(string p)
{
cnt++;
int sl=0;
for(int i=0;i<p.size();i++)
{
for(int j=0;j<ans.size() && i+j<p.size();j++)
{
///cout<<i<<"\t"<<ans[j]<<" "<<p[i+j]<<"\n";
if(ans[j]==p[i+j])
{
sl=max(sl,j+1);
}
else
{
break;
}
}
}
return sl;
}**/
string guess_sequence(int n)
{
string sl;
string ch;
if(press("AB")!=0)
{
if(press("A")!=0)
{
ch="BXY";
sl="A";
}
else
{
ch="AXY";
sl="B";
}
}
else
{
if(press("X")!=0)
{
ch="ABY";
sl="X";
}
else
{
ch="ABX";
sl="Y";
}
}
for(int now=1;now+1<n;now++)
{
string q=(sl+ch[2]+ch[0])+(sl+ch[2]+ch[1])+(sl+ch[2]+ch[2])+(sl+ch[1]);
int value=press(q);
sl+=ch[value-now];
}
if(press(sl+ch[0])==n)
{
sl+=ch[0];
}
else
{
if(press(sl+ch[1])==n)
{
sl+=ch[1];
}
else
{
sl+=ch[2];
}
}
return sl;
}