제출 #853522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
853522		lamter	콤보 (IOI18_combo)	C++17	0 / 100	31 ms	344 KiB

combo

#include "combo.h"
#include <bits/stdc++.h>

std::string guess_sequence(int n) {
	std::vector <char> KEYS = {'A', 'B', 'X', 'Y'};

	std::string ans = press("AB") ? press("A") ? "A" : "B" : press("X") ? "X" : "Y";

	KEYS.erase(std::find(KEYS.begin(), KEYS.end(), ans[0]));

	while ((int) ans.size() <= n - 2) {
		int t = press(ans + KEYS[0] + KEYS[0] + ans + KEYS[0] + KEYS[1] + ans + KEYS[1] + KEYS[0]);

		if (t == (int) ans.size())
			ans = ans + KEYS[2];
		if (t == (int) ans.size() + 1)
			ans = ans + (press(ans + KEYS[0]) == (int) ans.size() ? KEYS[1] : KEYS[0]) + KEYS[2];
		if (t == (int) ans.size() + 2) {
			int tt = press(ans + KEYS[0] + KEYS[0]);
			if (tt == (int) ans.size())
				ans = ans + KEYS[1] + KEYS[0];
			if (tt == (int) ans.size() + 1)
				ans = ans + KEYS[0] + KEYS[1];
			if (tt == (int) ans.size() + 2)
				ans = ans + KEYS[0] + KEYS[0];
		}
	}

	while ((int) ans.size() != n) {
		if (press(ans + KEYS[0]) != (int) ans.size()) {
			ans += KEYS[0];
			break;
		}
		if (press(ans + KEYS[1]) != (int) ans.size()) {
			ans += KEYS[1];
			break;
		}
		ans += KEYS[2];
	}

	return ans;
}

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