제출 #1007183

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

combo

#include <bits/stdc++.h>
#include "combo.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long int ull;
const ll md = 1e9+7;
const int ukr = 2e5+10;
vector<int> v;
string s;
string guess_sequence(int N) {
    string ans = "";
    int val = press("AB");
    if(val >= 1){
        if(val == 1){
            ans += "A";
        }else{
            ans += "B";
        }
    }else{
        val = press("X");
        if(val >= 1){
            ans += "X";
        }else{
            ans += "Y";
        }
    }
    N--;
    if(!N){
        return ans;
    }
    if(ans == "A"){
        int old = ans.length();
        while(N-1){
            val = press(ans+"BB"+ans+"BX"+ans+"BY"+ans+"X");
            if((val-old) == 2){
                ans += "B";
            }else if((val-old)){
                ans += "X";
            }else{
                ans += "Y";
            }
            old++;
            N--;
        }
        val = press(ans+"B");
        if(val == old+1){
            ans += "B";
        }else{
            val = press(ans+"X");
            if(val == old+1){
                ans += "X";
            }else{
                ans += "Y";
            }
        }
    }else if(ans == "B"){
        int old = ans.length();
        while(N-1){
            val = press(ans+"AA"+ans+"AX"+ans+"AY"+ans+"X");
            if((val-old) == 2){
                ans += "A";
            }else if((val-old)){
                ans += "X";
            }else{
                ans += "Y";
            }
            old++;N--;
        }
        val = press(ans+"A");
        if(val == old+1){
            ans += "A";
        }else{
            val = press(ans+"X");
            if(val == old+1){
                ans += "X";
            }else{
                ans += "Y";
            }
        }
    }else if(ans == "X"){
        int old = ans.length();
        while(N-1){
            val = press(ans+"AA"+ans+"AB"+ans+"AY"+ans+"B");
            if((val-old) == 2){
                ans += "A";
            }else if((val-old)){
                ans += "B";
            }else{
                ans += "Y";
            }
            old++;N--;
        }
        val = press(ans+"B");
        if(val == old+1){
            ans += "B";
        }else{
            val = press(ans+"A");
            if(val == old+1){
                ans += "A";
            }else{
                ans += "Y";
            }
        }
    }else{
        int old = ans.length();
        while(N-1){
            val = press(ans+"AA"+ans+"AB"+ans+"AX"+ans+"B");
            if((val-old) == 2){
                ans += "A";
            }else if((val-old)){
                ans += "B";
            }else{
                ans += "X";
            }
            old++;N--;
        }
        val = press(ans+"B");
        if(val == old+1){
            ans += "B";
        }else{
            val = press(ans+"X");
            if(val == old+1){
                ans += "X";
            }else{
                ans += "A";
            }
        }
    }
    return ans;
}
/* int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
  int t =1;
    //cin >> t;
    for(int i = 1; i <= t; i++){
        //cout << "Case " << i << ": ";
        solve();
    }
} */

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