# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438414 | Bom164 | 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>
#include<iostream>
#include "combo.h"
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define mod 1000000007
#define inf 1e18
#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define w(x) int x; cin>>x; while(x--)
string s="";
string sf;
string guess_sequence(int n){
int A=press("A");
int B=press("B");
int X=press("X");
if(A==1) s+="A";
else if(B==1) s+="B";
else if(X==1) s+="X";
else s+="Y";
if(n==1){
return s;
}
if(s=="A"){
for(int i=1;i<n-1;i++){
int c = press(s+"B"+s+"XB"+s+"XX"+s+"XY");
if(c==ss) s+="Y";
else if(c==ss+1) s+="B";
else s+="X";
}
sf = s+"B";
int q=press(sf);
if(q==n){
return sf;
}
sf=s+"X";
q=press(sf);
if(q==n){
return sf;
}
else{
return s+"Y";
}
}else if(s=="B"){
for(int i=1;i<n-1;i++){
int c = press(s+"A"+s+"XA"+s+"XX"+s+"XY");
if(c==ss) s+="Y";
else if(c==ss+1) s+="A";
else s+="X";
}
sf = s+"A";
int q=press(sf);
if(q==n){
return sf;
}
sf=s+"X";
q=press(sf);
if(q==n){
return sf;
}
else{
return s+"Y";
}
}else if(s=="X"){
for(int i=1;i<n-1;i++){
int c = press(s+"B"+s+"AB"+s+"AA"+s+"AY");
if(c==ss) s+="Y";
else if(c==ss+1) s+="B";
else s+="A";
}
sf = s+"A";
int q=press(sf);
if(q==n){
return sf;
}
sf=s+"B";
q=press(sf);
if(q==n){
return sf;
}
else{
return s+"Y";
}
}else if(s=="Y"){
for(int i=1;i<n-1;i++){
int c = press(s+"B"+s+"XB"+s+"XX"+s+"XA");
if(c==ss) s+="A";
else if(c==ss+1) s+="B";
else s+="X";
}
sf = s+"A";
int q=press(sf);
if(q==n){
return sf;
}
sf=s+"B";
q=press(sf);
if(q==n){
return sf;
}
else{
return s+"X";
}
}
return s;
}