Submission #434393

#	Time	Username	Problem	Language	Result	Execution time	Memory
434393		bipartite_matching	Combo (IOI18_combo)	C++14	100 / 100	44 ms	664 KiB

combo

#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;
}

• Subtask 1: 5 / 5
• Subtask 2: 95 / 95