제출 #390905

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
390905		Blistering_Barnacles	콤보 (IOI18_combo)	C++11	10 / 100	109 ms	532 KiB

combo

#include "combo.h"
#include<bits/stdc++.h>
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
using namespace std;
typedef long long ll;
str guess_sequence(int N) {
    char a[] = {'A' , 'X' , 'Y' , 'B'} ;
    ll o = 0 ;
    str ans = "" ;
    for(ll i = 0 ; i < N ; i++){
        for(ll j = 0 ; j < 4 ; j++){
            ans += a[j] ;
            ll p = press(ans) ;
            if(p > o){
                o = p ;
                B ;
            }
            ans.pop_back() ;
            //cout << ans << " " ;
        }
    }
    R ans ;
}

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