# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107279 | kyunamk | Combo (IOI18_combo) | C++14 | 54 ms | 668 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 "combo.h"
#include <vector>
#include <iostream>
using namespace std;
static int debug = false;
string guess_sequence(int N) {
string p = "";
vector<char> b ;
b.push_back('A');
b.push_back('B');
b.push_back('X');
b.push_back('Y');
string prefix ="";
if ( press("AB") )
{
//AB
if (press("A") ) {
prefix = "A";
b.erase(b.begin()+0);
}
else
{
prefix = "B";
b.erase(b.begin()+1);
}
}
else
{
//AB
if (press("X") )
{
prefix = "X";
b.erase(b.begin()+2);
}
else
{
prefix = "Y";
b.erase(b.begin()+3);
}
}
if(debug) cout << b[0] << b[1] << b[2] << endl;
while ( prefix.length() < N-1 ) {
int i = 0 ;
int n = 0;
string append = prefix;
append = prefix;
string s ="";
s+=prefix +b[1];
for ( i = 0 ; i < 3 ; i++) {
s+=prefix+b[2]+b[i];
}
if(debug) cout << s << " ";
n = press(s) ;
if(debug) cout << n << endl;
prefix += b[n-prefix.length()];
if(debug) cout << "prefix " << prefix << endl;
}
if ( N > 1) {
if ( press(prefix + b[0] + prefix + b[1]) == N ) {
if ( press(prefix + b[0]) == N )
prefix.append(1,b[0]);
else
prefix.append(1,b[1]);
} else
{
prefix.append(1,b[2]);
}
}
if(debug) cout << prefix << endl;
return prefix;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |