| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 335306 |
2020-12-11T22:16:45 Z |
fadi57 |
Combo (IOI18_combo) |
C++14 |
|
2 ms |
200 KB |
#include "combo.h"
#include <bits/stdc++.h>
//#include"grader.cpp"
using namespace std;
std::string guess_sequence(int N) {
std::string p = "";
string s="ABXY";
string first;
/*
for(int i=0;i<4;i++){
p=s[i];
int ok=press(p);
//cout<<ok;
if(ok==1){
first=s[i]; break;
}
}*/
int query=press("AB");
string ret;
if(query){
ret=press("A")?"A":"B";
}else{
ret=press("X")?"X":"Y";
}
first=ret;
s.erase(find(s.begin(),s.end(),first[0]));
//cout<<s<<endl;
int si=N;si--;
int now=2;
for(int i=2;i<N;i++){
string tr=ret+s[0]+ret+s[1]+s[0]+ret+s[1]+s[1]+ret+s[1]+s[2];
//cout<<"DEBUG "<<tr<<endl;
query=press(tr);
if(query==now){ret+=s[0];}else if(query==now+1){ret+=s[1];}else{ret+=s[2];}
now++;
}
if(press(ret+s[0])==N){
ret+=s[0];
}else if(press(ret+s[1])==N){ret+=s[1];}else{
ret+=s[2];
}//cout<<ret<<endl;
return ret;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
200 KB |
Output is correct |
| 2 |
Correct |
2 ms |
200 KB |
Output is correct |
| 3 |
Correct |
0 ms |
200 KB |
Output is correct |
| 4 |
Correct |
0 ms |
200 KB |
Output is correct |
| 5 |
Correct |
0 ms |
200 KB |
Output is correct |
| 6 |
Correct |
1 ms |
200 KB |
Output is correct |
| 7 |
Correct |
1 ms |
200 KB |
Output is correct |
| 8 |
Correct |
1 ms |
200 KB |
Output is correct |
| 9 |
Correct |
0 ms |
200 KB |
Output is correct |
| 10 |
Correct |
0 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 |
2 ms |
200 KB |
Output is correct |
| 17 |
Correct |
1 ms |
200 KB |
Output is correct |
| 18 |
Correct |
1 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 |
1 ms |
200 KB |
Output is correct |
| 22 |
Correct |
1 ms |
200 KB |
Output is correct |
| 23 |
Correct |
0 ms |
200 KB |
Output is correct |
| 24 |
Correct |
0 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 |
1 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 |
0 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 |
- |
