# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
534527 | YaserFaisal | Combo (IOI18_combo) | C++17 | 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>
#include "combo.h"
using namespace std;
string call( string cur , int siz , int n )
{
int x , y ;
if ( siz == n-1 )
{
if ( cur[0] == "A" )
{
x = press(cur+"B") ;
y = press(cur+"X") ;
if ( x == n ) return cur+"B" ;
else if ( y == n ) return cur+"X" ;
else return cur+"Y" ;
}
if ( cur[0] == "B" )
{
x = press(cur+"A") ;
y = press(cur+"X") ;
if ( x == n ) return cur+"A" ;
else if ( y == n ) return cur+"X" ;
else return cur+"Y" ;
}
if ( cur[0] == "X" )
{
x = press(cur+"B") ;
y = press(cur+"A") ;
if ( x == n ) return cur+"B" ;
else if ( y == n ) return cur+"A" ;
else return cur+"Y" ;
}
if ( cur[0] == "Y" )
{
x = press(cur+"B") ;
y = press(cur+"X") ;
if ( x == n ) return cur+"B" ;
else if ( y == n ) return cur+"X" ;
else return cur+"A" ;
}
}
if ( cur[0] == "A" )
{
x = press(cur+"B"+cur+"XX"+cur+"XY"+cur+"XB") ;
if ( x == siz+1 ) return cur+"B" ;
else if ( x == siz+2 ) return cur+"X" ;
else return cur+"Y" ;
}
if ( cur[0] == "B" )
{
x = press(cur+"A"+cur+"XX"+cur+"XY"+cur+"XA") ;
if ( x == siz+1 ) return cur+"A" ;
else if ( x == siz+2 ) return cur+"X" ;
else return cur+"Y" ;
}
if ( cur[0] == "X" )
{
x = press(cur+"B"+cur+"AX"+cur+"AY"+cur+"AB") ;
if ( x == siz+1 ) return cur+"B" ;
else if ( x == siz+2 ) return cur+"A" ;
else return cur+"Y" ;
}
if ( cur[0] == "Y" )
{
x = press(cur+"B"+cur+"XX"+cur+"XY"+cur+"XB") ;
if ( x == siz+1 ) return cur+"B" ;
else if ( x == siz+2 ) return cur+"X" ;
else return cur+"A" ;
}
}
string guess_sequence (int n)
{
for ( int i = 0 ; i <= 2000 ; i++ )
{
}
string cur = "" ;
int x = press("AB") ;
if ( x == 0 )
{
if ( press(cur+"X") == 1 ) cur+="X" ;
else cur+="Y" ;
}
else
{
if ( press(cur+"A") == 1 ) cur+="A" ;
else cur+="B" ;
}
while(cur.size()<) cur = call(cur,cur.size(),n) ;
return cur ;
}