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 pair<int, int> ii;
typedef vector<pair<int, int>> vii;
typedef vector<int> vi;
typedef long long ll;
#define PB push_back
#define MP make_pair
#define FOR(i, x, y) for (ll i = x; i < y ; i ++)
string guess_sequence(int n){
string s;
string l[] = {"A", "B", "X", "Y"};
string start;
vector<string> m;
int temp;
FOR(i, 0, 4){
cout << "press(" + l[i] + ")"; cin >> temp;
if (temp) s = l[i];
else m.PB(l[i]);
}
start = s;
int num = 1;
string check = start + m[0] + m[2] + start + m[1] + m[2];
while (num < n){
int guess;
cout << "press(" + s + check + ")"; cin >> guess;
if (guess == 0){
s += m[2];
num ++;
}
else if (guess == 1){
int guess2;
cout << "press(" + s + m[0] +")"; cin >> guess2;
if (guess2) s += m[0];
else s += m[1];
cout << "press(" + s + m[0] +")"; cin >> guess2;
if (guess2) s += m[0];
else s += m[1];
num += 2;
}
else{
int guess2;
cout << "press(" + s + m[0] +")"; cin >> guess2;
if (guess2) s += (m[0] + m[2]);
else s += (m[1] + m[2]);
num += 2;
}
}
return s;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |