제출 #438075

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
438075		Bom164	콤보 (IOI18_combo)	C++14	0 / 100	2 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 guess_sequence(int n){
    int cc=n;
    int A=press("A");
    int B=press("B");
    int X=press("X");
    int Y= 1-A-B-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){
            int c = press(s+"B"+s+"XB"+s+"XX"+s+"XY");
            if(c==ss) s+="Y";
            else if(c==ss+1) s+="B";
            else s+="XX";
            ss=s.size();
        }
    }else if(s=="B"){
        while(ss!=cc){
            int c = press(s+"A"+s+"XA"+s+"XX"+s+"XY");
            if(c==ss) s+="Y";
            else if(c==ss+1) s+="A";
            else s+="XX";
            ss=s.size();
        }
    }else if(s=="X"){
        while(ss!=cc){
            int c = press(s+"B"+s+"AB"+s+"AA"+s+"AY");
            if(c==ss) s+="Y";
            else if(c==ss+1) s+="B";
            else s+="AA";
            ss=s.size();
        }
    }else if(s=="Y"){
        while(ss!=cc){
            int c = press(s+"B"+s+"XB"+s+"XX"+s+"XA");
            if(c==ss) s+="A";
            else if(c==ss+1) s+="B";
            else s+="XX";
            ss=s.size();
        }
    }
    return s;
}

컴파일 시 표준 에러 (stderr) 메시지

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:27:9: warning: unused variable 'Y' [-Wunused-variable]
   27 |     int Y= 1-A-B-X;
      |         ^

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