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 "combo.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
int vpress(string a){
// cout << a << " ";
int val = press(a);
// cout << val << endl;
return val;
}
string guess_sequence(int N) {
vector<char> chars = {'A','B','X','Y'};
string ans = "";
if(vpress("AB") >= 1){
if(vpress("A") >= 1){
ans = "A";
chars.erase(chars.begin()+0);
}else{
ans = "B";
chars.erase(chars.begin()+1);
}
}else{
if(vpress("X") >= 1){
ans = "X";
chars.erase(chars.begin()+2);
}else{
ans = "Y";
chars.erase(chars.begin()+3);
}
}
if(N == 1)return ans;
FOR(i,ans.size()+1,N){
string temp = ans + chars[0];
string temp2;
FOR(j,0,3)temp2 += ans + chars[1] + chars[j];
int val = vpress(temp+temp2);
if(val == i){
ans += chars[0];
}else if(val == i+1){
ans += chars[1];
}else{
ans += chars[2];
}
}
FOR(j,0,2){
string temp = ans + chars[j];
if(vpress(temp) == N)return temp;
}
return ans + chars[2];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |