제출 #254549

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254549		khangal	콤보 (IOI18_combo)	C++14	100 / 100	62 ms	29560 KiB

combo

#include<bits/stdc++.h>
#include "combo.h"
using namespace std;
typedef int ll; 
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// ll n,m,ans,mid,mn,mx,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z,res,cnt,sz;
bool used[1234567];
vector<ll> v[1234567];
string s1,s;
vector<string> c = {"A", "B", "X", "Y"}; 
 
string guess_sequence(int N) {
    int first = -1;
    if(press("AB")) {
        if(press("A")) first = 0;
        else first = 1; 
    } else if(press("X")) first = 2; 
    else first = 3;
    
    string ans = c[first]; 
    c.erase(c.begin() + first); 
 
    for(int i = 1; i < N - 1; i++) {
        string s = ans+c[0]+c[0]+ans+c[0]+c[1]+ans+c[0]+c[2]+ans+c[1];  
        int x = press(s); 
        if(x == i + 2) ans += c[0];
        else if(x == i+1) ans += c[1]; 
        else ans += c[2]; 
    }
    if(N > 1) {     
        if(press(ans+c[0]) == N) ans += c[0];
        else if(press(ans + c[1]) == N) ans += c[1] ;
        else ans += c[2];
    }
    return ans; 
}

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