# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313300 | noob_c0de | 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.
// author shenron
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree <T, null_type, less<T> ,rb_tree_tag,tree_order_statistics_node_update>;
#define int long long
#define ar array
#define db double
const db pi = acos(-1);
string ans;
string guess_sequence(int n)
{
string init;
// first character
int q1=press("AB");
if (q1==1)
{
int q2=press("A");
if (q2==1)
{
ans+='A';
init="BXY";
}
else
{
ans+='B';
init="AXY";
}
}
else
{
int q2=press("X");
if (q2==1)
{
ans+='X';
init="ABY";
}
else
{
ans+='Y';
init="ABX";
}
}
// n-2 next character
for (int i=1;i<n;i++)
{
string ask=ans+init[0];
for (int ch=0;ch<3;ch++)
{
ask+=ans;
ask+=init[1];
ask+=init[ch];
}
int res=press(ask);
if (res==ans.size()) ans+=init[2];
else if(res==ans.size()+1) ans+=init[0];
else ans+=init[1];
}
// last character
string ask;
for (int i=0;i<2;i++)
{
ask+=ans;
ask+=init[i];
}
int res=press(ask);
if (res==ans.size()) ans+=init[2];
else
{
ask=ans+init[0];
res=press(ask);
if (res==ans.size()) ans+=init[1];
else ans+=init[0];
}
return(ans);
}