| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 75614 |
2018-09-10T14:12:37 Z |
joseacaz |
Combo (IOI18_combo) |
C++17 |
|
2 ms |
256 KB |
#include "combo.h"
#include <bits/stdc++.h>
using namespace std;
int ans, cnt;
string S, first, aux, let1, let2, let3;
string guess_sequence ( int N )
{
cnt = 1;
ans = press ( "AB" );
if ( ans == 0 )
{
ans = press ( "X" );
if ( ans == 0 )
first = "Y", S = "Y";
else
first = "X", S = "X";
}
else if ( ans == 1 )
{
ans = press ( "A" );
if ( ans == 0 )
first = "B", S = "B";
else
first = "A", S = "A";
}
else if ( ans == 2 )
first = "A", S = "AB", cnt = 2;
if ( first == "A" )
let1 = "B", let2 = "X", let3 = "Y";
else if ( first == "B" )
let1 = "A", let2 = "X", let3 = "Y";
else if ( first == "X" )
let1 = "A", let2 = "B", let3 = "Y";
else if ( first == "Y" )
let1 = "A", let2 = "B", let3 = "X";
for ( ; cnt < N - 1; cnt++ )
{
aux = S + let1;
aux += S + let2 + let1;
aux += S + let2 + let2;
aux += S + let2 + let3;
ans = press ( aux );
if ( ans == cnt + 1 )
S += let1;
else if ( ans == cnt + 2 )
S += let2;
else if ( ans == cnt )
S += let3;
}
ans = press ( S + let1 + S + let2 );
if ( ans == cnt )
S += let3;
else if ( ans == cnt + 1 )
{
ans = press ( S + let1 );
if ( ans == cnt )
S += let2;
else
S += let1;
}
//cout << S << "\n";
return S;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
200 KB |
Output is correct |
| 2 |
Correct |
1 ms |
200 KB |
Output is correct |
| 3 |
Correct |
1 ms |
200 KB |
Output is correct |
| 4 |
Correct |
1 ms |
200 KB |
Output is correct |
| 5 |
Correct |
1 ms |
220 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 |
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 |
252 KB |
Output is correct |
| 13 |
Correct |
1 ms |
200 KB |
Output is correct |
| 14 |
Correct |
1 ms |
256 KB |
Output is correct |
| 15 |
Correct |
1 ms |
200 KB |
Output is correct |
| 16 |
Correct |
1 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 |
2 ms |
200 KB |
Output is correct |
| 22 |
Correct |
2 ms |
240 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 |
232 KB |
Output is correct |
| 26 |
Correct |
2 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 |
2 ms |
252 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 |
256 KB |
Output is correct |
| 33 |
Correct |
1 ms |
256 KB |
Output is correct |
| 34 |
Correct |
1 ms |
200 KB |
Output is correct |
| 35 |
Correct |
1 ms |
212 KB |
Output is correct |
| 36 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
208 KB |
Wrong Answer: wrong guess. |
| 2 |
Halted |
0 ms |
0 KB |
- |
