제출 #543368

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
543368		Blobo2_Blobo2	콤보 (IOI18_combo)	C++14	100 / 100	37 ms	540 KiB

combo

#include<bits/stdc++.h>
#include "combo.h"
//#include "grader.cpp"
using namespace std;
//#define int long long
//#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2 ios_base::sync_with_stdio(false);cin.tie(0);

char le[]={'A','B','X','Y'};
string guess_sequence(int n){
	string t = "AB";
	int x = press(t);
	if(x == 2) t = "A";
	else if(x){
		t = "B";
		x=press(t);
		if(!x)
			t = "A";
	}
	else{
		t = "X";
		x = press(t);
		if(!x)
			t = "Y";
	}
	if(n == 1)
        return t;
	int idx = 0;
	for(int i=0;i<4;i++){
		if(le[i] == t[0]){
			idx = i;
			break;
		}
	}
	for(int i=1;i<n-1;i++){
		string test;
		test += t;
		test += le[(idx+1)%4];
		test += t;
		test += le[(idx+2)%4];
		test += le[(idx+1)%4];
		test += t;
		test += le[(idx+2)%4];
		test += le[(idx+2)%4];
		test += t;
		test += le[(idx+2)%4];
		test += le[(idx+3)%4];
		x = press(test);

		if(x == (int)t.size())
			t += le[(idx+3)%4];
		else if(x == (int)t.size()+1)
			t += le[(idx+1)%4];
		else
			t += le[(idx+2)%4];
	}
	t += le[(idx+1)%4];
	x = press(t);
	if(x == n)
        return t;
    t.pop_back();
    t += le[(idx+2)%4];
    x = press(t);
    if(x == n)
        return t;
    t.pop_back();
    t += le[(idx+3)%4];
    return t;
}

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