| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 245712 | uacoder123 | 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;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
string guess_sequence(int N);
{
int n=N;
string s;
vector<string> v={"A","B","C","D"};
if(press("AB")==1)
{
if(press("A"))
s+="A";
else
s+="B";
}
else
{
if(press("X"))
s+="X";
else
s+="Y";
}
v.erase(s);
v.pb(s);
for(int i=0;i<n-1;++i)
{
int x=press(s+v[0]+s+v[1]+v[0]+s+v[1]+v[1]+s+v[1]+v[2]);
if(x==s.size()+1)
s+=v[0];
else if(x==s.size()+2)
s+=v[1];
else
s+=v[2];
}
if(press(s+"A"+s+"B")==s.size()+1)
{
if(press(s+"A")==s.size()+1)
s+="A";
else
s+="B";
}
else
{
if(press(s+"X")==s.size()+1)
s+="X";
else
s+="Y";
}
return(s);
}