| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 538847 | beaconmc | Combo (IOI18_combo) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*
.'.................',.
............'''',,'''',,'..
......''';:cloodxxxxdolc;,''..
......',;,:lddxkkOO000Okkxdc,....
.....';;;;:ldddxkkOO0K0Okkkxdc,...
....';::;:ldddxxkkkO000Okkkxdo:....
...';;;:codddddxxxkkOO00Okkxxo:'... ██████╗ ███████╗ █████╗ ██████╗ ██████╗ ███╗ ██╗
...';,,:cloooooddddddxxxddddddc'... ██╔══██╗██╔════╝██╔══██╗██╔════╝██╔═══██╗████╗ ██║
..',,,'',;;:cclollcc;,''',;coo;.. ██████╔╝█████╗ ███████║██║ ██║ ██║██╔██╗ ██║
..,,,''....',:oddl:,'..',,,:od:.'. ██╔══██╗██╔══╝ ██╔══██║██║ ██║ ██║██║╚██╗██║
..';;'','....'cdkOx:'',,;clclodc,:, ██████╔╝███████╗██║ ██║╚██████╗╚██████╔╝██║ ╚████║
..';;,,,,',,',cdkkxolccccloddooc;:; ╚═════╝ ╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝ ╚═╝ ╚═══╝
.';::cllc::,,cdxxdooollloddxxdlcoc. ________ ___
.';:clc:;;;,;codddooolc::cclooodkc. ███████╗██╗ ██╗███████╗███████╗██╗ ██╗ ██████╗ ██████╗ ██████╗ ███████╗ /_ __/ |/ /
.';;;,,,,,,,;cooollloolc;,',:cc:,. ██╔════╝██║ ██║██╔════╝██╔════╝╚██╗ ██╔╝ ██╔════╝██╔═══██╗██╔══██╗██╔════╝ / / / /|_/ /
.,,,'..',,,,,::::cccc:;''..;:,. ███████╗██║ ██║███████╗███████╗ ╚████╔╝ ██║ ██║ ██║██║ ██║█████╗ /_/ /_/ /_/
';:;,..,;;;,;:ccllool;';;;::. ╚════██║██║ ██║╚════██║╚════██║ ╚██╔╝ ██║ ██║ ██║██║ ██║██╔══╝
.,:::,';oxxxxkkO00KOocclcc:. ███████║╚██████╔╝███████║███████║ ██║ ╚██████╗╚██████╔╝██████╔╝███████╗
.';::,',coxxkkkkxxo:cool;. ╚══════╝ ╚═════╝ ╚══════╝╚══════╝ ╚═╝ ╚═════╝ ╚═════╝ ╚═════╝ ╚══════╝
.,:;,'',:cccllodolodo:.
..''',;;;;::cllooooodddocc:;,..
....'',;;'''',;::cclllloddddlclolcdxdl:,..
..'',,'',;,,;;,,''';:ccloloodddol:::llldkkkkxxdl;.
:,,,;,',;;,,;,'',,,,,:clooooool::clc:coxxxkkkkkkkx
''',,,',;;,,,'.',,,,'';:cccc:;,;cloollodxxkkkkkkkk
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "combo.h"
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
int press(string X){
if (X=="XY" || X=="Y"){
return 1;
}else{
return 0;
}
}
string guess_sequence(int N){
int n = N;
vector<char> possible = {'A','B','X','Y'};
string prev = "";
if (press("AB")){
if(press("A")){
possible.erase(possible.begin()+0);
prev += "A";
}else{
possible.erase(possible.begin()+1);
prev += "B";
}
}else{
if(press("X")){
possible.erase(possible.begin()+2);
prev += "X";
}else{
possible.erase(possible.begin()+3);
prev += "Y";
}
}
FOR(i,0,n-2){
string query = "";
query += prev + possible[0];
query += prev + possible[1] + possible[0];
query += prev + possible[1] + possible[1];
query += prev + possible[1] + possible[2];
int sus = press(query);
if (sus == i+2){
prev += possible[0];
}else if (sus==i+3){
prev += possible[1];
}else{
prev += possible[2];
}
}
if (n>1){
if (press(prev + "A" + prev + "B")){
if(press(prev + "A")){
prev += "A";
}else{
prev += "B";
}
}else{
if(press(prev + "X")){
prev += "X";
}else{
prev += "Y";
}
}
}
return prev;
}
int main(){
cout << guess_sequence(1);
}