Submission #1034288

#	Time	Username	Problem	Language	Result	Execution time	Memory
1034288		vjudge1	Combo (IOI18_combo)	C++17	10 / 100	37 ms	956 KiB

combo

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 

#define fst first 
#define snd second
#define pb push_back
#define forn(i,a,b) for(int i = a; i < b; i++)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define dbg(v) cout<<"Line("<<__LINE__<<"): "<<#v<<" = "<<v<<'\n';
#define pi pair<int,int>
#define pll pair<ll,ll>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_multiset;



#include "combo.h"

const int MAXC = 4;

char chars[MAXC];

std::string guess_sequence(int N) {
	
	chars[0]='A';
	chars[1]='B';
	chars[2]='X';
	chars[3]='Y';
	
	string aux;
	
	char fChar;
	forn(i,0,MAXC){
		aux=""; aux+=chars[i];
		if(press(aux)){
			fChar=chars[i];
			break;
		}
	}
	
	string res = ""; res+=fChar;
	
	forn(i,1,N){
		forn(j,0,MAXC) if(chars[j]!=fChar){
			if(press(res+chars[j])==i+1){
				res+=chars[j];
				break;
			}
		}
	}
	
	return res;
}

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