# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
434390 | bipartite_matching | 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 forint(i, N) for (int i = 0; i < (N); i++)
using namespace std;
int press(string p);
string guess_sequence(int N) {
string ans = "";
vector<char> v;
if (press("AB") == 1) {
if (press("A") == 1) {
ans += 'A';
v = {'B', 'X', 'Y'};
}
else {
ans += 'B';
v = {'A', 'X', 'Y'};
}
}
else {
if (press("X") == 1) {
ans += 'X';
v = {'A', 'B', 'Y'};
}
else {
ans += 'Y';
v = {'A', 'B', 'X'};
}
}
/*if (press("A") == 1) {
ans += 'A';
v = {'B', 'X', 'Y'};
}
else if (press("B") == 1) {
ans += 'B';
v = {'A', 'X', 'Y'};
}
else if (press("X") == 1) {
ans += 'X';
v = {'A', 'B', 'Y'};
}
else {
ans += 'Y';
v = {'A', 'B', 'X'};
}*/
if (N == 1) {
return ans;
}
//int pos = 1;
for (int i = 1; i < N - 1; i++) {
int tmp = press(ans + v[0] + ans + v[1] + v[0] + ans + v[1] + v[1] + ans + v[1] + v[2]);
if (tmp == i + 1) {
ans += v[0];
}
else if (tmp == i + 2) {
ans += v[1];
}
else {
ans += v[2];
}
}
if (press(ans + v[0]) == N) {
ans += v[0];
}
else if (press(ans + v[1]) == N) {
ans += v[1];
}
else {
ans += v[2];
}
return ans;
}
string test = "A";
int press(string p) {
int ret = 0;
queue<int> q;
forint(i, p.length()) {
if (p[i] == test[0]) {
q.push(i);
}
}
if (!q.empty()) {
ret++;
}
else {
return 0;
}
while (!q.empty()) {
int a = q.size();
forint(i, a) {
int tmp = q.front();
q.pop();
if (tmp + 1 < p.length() && p[tmp + 1] == test[ret]) {
q.push(tmp + 1);
}
}
if (!q.empty()) {
ret++;
}
}
return ret;
}