# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152677 | Segtree | 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<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
string guess_sequence(int N){
string d="ABXY";
string s="Y";
for(int r=0;r<3;r++){
string p=""; p+=d[r];
if(press(p)==1)s=p;
}
char fi=s[0];
for(int i=2;i<=N;i++){
char res='#',rem;
ll cnt=0;
for(int r=0;r<4;r++){
if(d[r]==fi)continue;
cnt++;
if(cnt==3){
rem=d[r];
break;
}
string p=s; p+=d[r];
if(press(p)==i)res=d[r];
}
if(res=='#')res=rem;
s+=res;
}
return s;
};
/*
int main(){
return 0;
}*/