제출 #769298

#제출 시각아이디문제언어결과실행 시간메모리
769298Mery2005콤보 (IOI18_combo)C++14
5 / 100
1 ms208 KiB
#include "combo.h" #include <iostream> #include <algorithm> #include <queue> #include <cmath> #include <vector> #include <list> #include <string> #include <unordered_map> #include <map> #include <set> #include <stack> #include <string> #include <iomanip> #include <fstream> using namespace std; string guess_sequence(int N){ string t; char x[4]; if(press("A")){ t = "A"; x[0] = 'B'; x[1] = 'X'; x[2] = 'Y'; } if(press("B")){ t = "B"; x[0] = 'A'; x[1] = 'X'; x[2] = 'Y'; } if(press("X")){ t = "X"; x[0] = 'B'; x[1] = 'A'; x[2] = 'Y'; } if(press("Y")){ t = "Y"; x[0] = 'B'; x[1] = 'X'; x[2] = 'A'; } string s = t; for(int i = 0 ; i < (N - 2) ; i++){ int ans = press(s + x[0] + x[0] + s + x[0] + x[1] + s + x[0] + x[2] + s + x[1]); if(ans == (int)s.size()){ s += x[2]; } else if(ans == ((int)s.size() + 1)){ s += x[1]; } else{ s += x[0]; } } int num = press(s + x[0] + s + x[1]); if (num == N){ num = press(s + x[0]); if (num == N){ return (s + x[0]); } else{ return (s + x[1]); } } else{ return (s + x[2]); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...