제출 #1143077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143077		jadai007	Combo (IOI18_combo)	C++20	10 / 100	20 ms	572 KiB

combo

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

using namespace std;
/*
int N;
string S;

int press(string p){
  int len = p.length();
  int coins = 0;
  for (int i = 0, j = 0; i < len; ++i) {
    if (j < N && S[j] == p[i]) {
      ++j;
    } else if (S[0] == p[i]) {
      j = 1;
    } else {
      j = 0;
    }
    coins = max(coins, j);
  }
  return coins;
}
*/


string guess_sequence(int N){
    string ans = "";
    bool back = true;
    while(ans.size() < N){
        if(back){
            string ck1 = ans + 'A';
            string ck2 = ans + 'B';
            string ck3 = ans + 'X';
            string ck4 = ans + 'Y';
            if(press(ck1) == ck1.size()) ans += 'A';
            else if(press(ck2) == ck2.size()) ans += 'B';
            else if(press(ck3) == ck3.size()) ans += 'X';
            else if(press(ck4) == ck4.size()) ans += 'Y';
            else back = false;
        }
        if(!back){
            string ck1 = 'A' + ans;
            string ck2 = 'B' + ans;
            string ck3 = 'X' + ans;
            string ck4 = 'Y' + ans;
            if(press(ck1) == ck1.size()) ans = ck1;
            else if(press(ck2) == ck2.size()) ans = ck2;
            else if(press(ck3) == ck3.size()) ans = ck3;
            else if(press(ck4) == ck4.size()) ans = ck4;
        }
    }
    return ans;
    
}

/*int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> N >> S;
    cout << guess_sequence(N);
    
}*/

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