# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1103994 | asdfghjk | Combo (IOI18_combo) | C++17 | 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>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define ld long double
#define S second
using namespace std;
const ll N = 5e3 + 5;
const ll NN = 4e5 + 5;
const ll INF = 1e18;
const ll inf = 1e9;
const ll MOD = 1e9 + 7;
char a[10];
int was[10];
string z[15];
int press(std::string p);
string find_first(){
string d = "";
d += a[1];
if(press(d) == 1){
a[1] = a[2];
a[2] = a[3];
a[3] = a[4];
return d;
}
d.pop_back();
d += a[2];
if(press(d) == 1){
a[2] = a[3];
a[3] = a[4];
return d;
}
d.pop_back();
d += a[3];
if(press(d) == 1){
a[3] = a[4];
return d;
}
d.pop_back();
d += a[4];
if(press(d) == 1){
return d;
}
}
string guess_sequence(int n){
a[1] = 'A';
a[2] = 'B';
a[3] = 'X';
a[4] = 'Y';
string s = find_first();
for(int i = 2;i <= n;i++){
if(s.size() > i)continue;
string d = s;
d += a[1];
d += a[2];
int res = press(d);
if(res == val){
s += a[3];
}
else if(res == val + 1){
d = s + a[1];
res = press(d);
if(res == val + 1){
s = d;
}
else{
s += a[2];
}
}
else{
s = d;
}
}
return s;
}