| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 322084 |
2020-11-14T03:18:08 Z |
kwongweng |
Combo (IOI18_combo) |
C++14 |
|
1 ms |
244 KB |
#include <bits/stdc++.h>
#include "combo.h"
using namespace std;
/*
string P = "ABXYYBXYYBXYYBXYY";
int press(string S){
int maxi = 0;
for (int i = 0; i < S.size(); i++){
int j = i, k = 0, cnt = 0;
while (j < S.size() && k < P.size()){
if (S[j] != P[k]) break;
cnt++; j++; k++;
}
maxi = max(maxi, cnt);
}
cout << S << " " << maxi << '\n';
return maxi;
}
*/
string guess_sequence(int n){
string S = "";
int a = press("AB");
if (a >= 1){
int b = press("A");
if (b == 1){
S += "A";
}else{
S += "B";
}
}else{
int b = press("X");
if (b == 1) S += "X";
else S += "Y";
}
string c = "ABXY";
string ch = "";
for (int i = 0; i < 4; i++){
if (c[i] == S[0]) continue;
ch += c[i];
}
for (int i = 1; i < n-1; i++){
string ask = S + ch[0] + ch[0] + S + ch[0] + ch[1] + S + ch[0] + ch[2] + S + ch[1];
int b = press(ask);
if (b == i) S += ch[2];
else if (b == i+1) S += ch[1];
else S += ch[0];
}
int b = press(S + ch[0]);
if (b == n) return S + ch[0];
int d = press(S + ch[1]);
if (d == n) return S + ch[1];
else return S + ch[2];
}
/*
int main(){
int n = P.size();
string s = guess_sequence(n);
cout << s << '\n';
}
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
200 KB |
Output is correct |
| 2 |
Correct |
0 ms |
200 KB |
Output is correct |
| 3 |
Correct |
1 ms |
200 KB |
Output is correct |
| 4 |
Correct |
0 ms |
200 KB |
Output is correct |
| 5 |
Correct |
1 ms |
200 KB |
Output is correct |
| 6 |
Correct |
0 ms |
200 KB |
Output is correct |
| 7 |
Correct |
0 ms |
244 KB |
Output is correct |
| 8 |
Correct |
0 ms |
200 KB |
Output is correct |
| 9 |
Correct |
1 ms |
200 KB |
Output is correct |
| 10 |
Correct |
1 ms |
200 KB |
Output is correct |
| 11 |
Correct |
1 ms |
200 KB |
Output is correct |
| 12 |
Correct |
1 ms |
200 KB |
Output is correct |
| 13 |
Correct |
1 ms |
200 KB |
Output is correct |
| 14 |
Correct |
1 ms |
200 KB |
Output is correct |
| 15 |
Correct |
1 ms |
200 KB |
Output is correct |
| 16 |
Correct |
1 ms |
200 KB |
Output is correct |
| 17 |
Correct |
0 ms |
200 KB |
Output is correct |
| 18 |
Correct |
0 ms |
200 KB |
Output is correct |
| 19 |
Correct |
1 ms |
200 KB |
Output is correct |
| 20 |
Correct |
1 ms |
200 KB |
Output is correct |
| 21 |
Correct |
0 ms |
200 KB |
Output is correct |
| 22 |
Correct |
1 ms |
200 KB |
Output is correct |
| 23 |
Correct |
1 ms |
200 KB |
Output is correct |
| 24 |
Correct |
1 ms |
200 KB |
Output is correct |
| 25 |
Correct |
1 ms |
200 KB |
Output is correct |
| 26 |
Correct |
1 ms |
200 KB |
Output is correct |
| 27 |
Correct |
1 ms |
200 KB |
Output is correct |
| 28 |
Correct |
0 ms |
200 KB |
Output is correct |
| 29 |
Correct |
0 ms |
200 KB |
Output is correct |
| 30 |
Correct |
1 ms |
200 KB |
Output is correct |
| 31 |
Correct |
1 ms |
200 KB |
Output is correct |
| 32 |
Correct |
1 ms |
200 KB |
Output is correct |
| 33 |
Correct |
1 ms |
200 KB |
Output is correct |
| 34 |
Correct |
1 ms |
200 KB |
Output is correct |
| 35 |
Correct |
1 ms |
200 KB |
Output is correct |
| 36 |
Correct |
0 ms |
200 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
200 KB |
Wrong Answer: wrong guess. |
| 2 |
Halted |
0 ms |
0 KB |
- |
