# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298650 | AmineTrabelsi | Combo (IOI18_combo) | C++17 | 0 ms | 200 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;
typedef long long ll;
#define v(x) vector<x>
#define pb push_back
#define mp make_pair
const ll maxint=2e18;
const ll minint =-2e18;
/*
(͡ ° ͜ʖ ͡ °): Hi, be careful of overflow.
*/
int press(string p);
/*
// comment out when submitting
int cnt = 0;
int n;
int press(string p){
cnt++;
cout<<p<<endl;
if((int)p.size() > n*4){
cout<<"Failed press n="<<(int)p.size()<<endl;
exit(0);
}
int x;
cin>>x;
return x;
}
*/
string let[4]={"A","B","X","Y"};
string guess_sequence(int N){
//n=N;
string res ="";
int avoid = 0;
int x = press(let[0]+let[1]);
if(x >= 1){
x = press(let[0]);
if(x == 1){avoid=0;
res+=let[0];
}else {avoid=1;res += let[1];}
}else{
x = press(let[2]);
if(x == 1){
res+=let[2];avoid=2;
}else {avoid=3;res +=let[3];}
}
vector<string> lett;
for(int i=0;i<4;i++)if(i!=avoid)lett.push_back(let[i]);
for(auto i:lett)cout<<i<<" ";cout<<endl;
int i=1;
for(;i<N-1;i++){
x = press((res+lett[0]+lett[0]+res+lett[0]+lett[1]+res+lett[0]+lett[2]+res+lett[1]));
if(x == i+2){
res+=lett[0];
}else if(x == i+1){
res+=lett[1];
}
else{
res += lett[2];
}
}
if(i < N){
x = press(res+lett[0]+res+lett[1]);
if(x == i+1){
x = press(res+lett[0]);
if(x == i+1){
res+=lett[0];
}else res+=lett[1];
}else{
res += lett[2];
}
}
return res;
}
//* Notes:
//* the first character of S never reappears in it
/*
// comment out when submitting
int main(){
int n;
cin>>n;
cout<<guess_sequence(n)<<'\n';
cout<<cnt<<endl;
return 0;
}
*/
/*
5
YABAB
4 = q-N
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |