제출 #438404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
438404		Bom164	콤보 (IOI18_combo)	C++14	0 / 100	1 ms	200 KiB

combo

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

using namespace std;

#define ll              long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define mod             1000000007
#define inf             1e18
#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define w(x)            int x; cin>>x; while(x--)

string s="";
string sf;

string guess_sequence(int n){
    int cc=n;
    int A=press("A");
    int B=press("B");
    int X=press("X");
    if(A==1) s+="A";
    else if(B==1) s+="B";
    else if(X==1) s+="X";
    else s+="Y";
    int ss = s.size();
    if(s=="A"){
        while(ss!=cc){
            sf=s[ss-1];
            int c = press(sf+"B"+sf+"XB"+sf+"XX"+sf+"XY");
            if(c==1) s+="Y";
            else if(c==2) s+="B";
            else s+="X";
            ss=s.size();
        }
    }else if(s=="B"){
        while(ss!=cc){
            sf=s[ss-1];
            int c = press(sf+"A"+sf+"XA"+sf+"XX"+sf+"XY");
            if(c==1) s+="Y";
            else if(c==2) s+="A";
            else s+="X";
            ss=s.size();
        }
    }else if(s=="X"){
        while(ss!=cc){
            sf=s[ss-1];
            int c = press(sf+"B"+sf+"AB"+sf+"AA"+sf+"AY");
            if(c==1) s+="Y";
            else if(c==2) s+="B";
            else s+="A";
            ss=s.size();
        }
    }else if(s=="Y"){
        while(ss!=cc){
            sf=s[ss-1];
            int c = press(sf+"B"+sf+"XB"+sf+"XX"+sf+"XA");
            if(c==1) s+="A";
            else if(c==2) s+="B";
            else s+="X";
            ss=s.size();
        }
    }
    return s;
}

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