# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162491 | abacaba | 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 <bits/stdc++.h>
#include "combo.h"
using namespace std;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define y1 abcde
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
string seq[4] = {"A", "B", "X", "Y"};
int n, let1 = 3;
string seq[4] = {"A", "B", "X", "Y"};
int n, let1 = 3;
string guess_sequence(int N) {
for(int i = 0; i < 3; ++i)
if(press(seq[i])) {
let1 = i;
break;
}
string s = seq[let1];
swap(seq[3], seq[let1]);
for(int i = 1; i + 1 < N; ++i) {
string now = s + seq[0];
for(int j = 0; j < 3; ++j)
now += s + seq[1] + seq[j];
int p = press(now);
if(p == s.size())
s += seq[2];
else if(p == s.size() + 1)
s += seq[0];
else
s += seq[1];
}
assert(s.size() == N - 1);
for(int i = 0; i < 2; ++i)
if(press(s + seq[i]) == N)
return s + seq[i];
return s + seq[2];
}