제출 #278913

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

combo

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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#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
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// 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,cnt,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;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
string guess_sequence(int N) {
    string S="";
    if(press("AB")>0){
        if(press("A")==1)S="A";
        else S="B";
    }
    else{
        if(press("X")==1)S="X"; 
        else S="Y";
    }
    vector<char> vec{'A','B','X','Y'};
    rep(i,0,3){
        if(vec[i]==S[0]){
            vec.erase(vec.begin()+i);
            break;
        }
    }
    while(S.size()<N-1){
        string tmp=S+vec[0]+vec[0]+S+vec[0]+vec[1]+S+vec[0]+vec[2]+S+vec[1];
        x=press(tmp);
        n = S.size();
        if(x==n)S.pb(vec[2]);
        if(x==n+1)S.pb(vec[1]);
        if(x==n+2)S.pb(vec[0]);
    }
    if(n==1)return S;
    if(press(S+vec[0]+S+vec[1])==N){
        if(press(S+vec[0])==N)S+=vec[0];
        else S+=vec[1];
    }
    else S+=vec[2];
    return S;   
}

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

combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:60:19: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |     while(S.size()<N-1){
      |           ~~~~~~~~^~~~

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