# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
897344 | honanhphong | 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>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
using namespace std;
using lli = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e6 + 1000;
const int mod = 1e9 + 7;
int press(string p);
string guess_sequence(int N)
{
string s = "";
char start;
char cs[maxn];
if (press("AB") != 0)
{
if (press("A") == 1)
{
s += 'A';
start = 'A';
} else
{
s += 'A';
start = 'A';
}
} else
{
if (press("X") == 1)
{
s += 'X';
start = 'X';
} else
{
s += 'Y';
start = 'Y';
}
}
if (start == 'A')
{
cs[0] = 'B'; cs[1] = 'X'; cs[2] = 'Y';
} else if (start == 'B')
{
cs[0] = 'A'; cs[1] = 'X'; cs[2] = 'Y';
} else if (start == 'X')
{
cs[0] = 'A'; cs[1] = 'B'; cs[2] = 'Y';
} else if (start == 'Y')
{
cs[0] = 'A'; cs[1] = 'B'; cs[2] = 'X';
}
for (lli i = 1; i < N - 1; i ++)
{
lli lcm1 = press(s + cs[0]);
lli lcm2 = press(s + cs[1]);
lli lcm3 = press(s + cs[2]);
if (lcm1 == s.length() + 1) s += cs[0];
else if (lcm2 == s.length() + 1) s += cs[1];
else s += cs[2];
}
return s;
}