| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 138154 |
2019-07-29T13:27:53 Z |
andremfq |
Combo (IOI18_combo) |
C++17 |
|
1000 ms |
240 KB |
#include "combo.h"
using namespace std;
#define debug
#define pb push_back
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#include <assert.h>>
#define mk make_pair
string guess_sequence(int tam)
{
if(tam != 3) while(1);
string p ;
p.resize( tam ) ;
char c[4] = {'A' , 'B' , 'X' , 'Y'} ;
lp(i,0,4)
lp(j,0,4)
lp(k,0,4)
{
p[0] = c[i] ;
p[1] = c[j] ;
p[2] = c[k] ;
if( press(p) == tam ) return p ;
}
}
Compilation message
combo.cpp:11:20: warning: extra tokens at end of #include directive
11 | #include <assert.h>>
| ^
combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:35:1: warning: control reaches end of non-void function [-Wreturn-type]
35 | }
| ^
| # |
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 |
3 ms |
200 KB |
Output is correct |
| 4 |
Correct |
1 ms |
200 KB |
Output is correct |
| 5 |
Correct |
1 ms |
200 KB |
Output is correct |
| 6 |
Correct |
2 ms |
220 KB |
Output is correct |
| 7 |
Correct |
1 ms |
200 KB |
Output is correct |
| 8 |
Correct |
2 ms |
200 KB |
Output is correct |
| 9 |
Correct |
1 ms |
200 KB |
Output is correct |
| 10 |
Correct |
2 ms |
200 KB |
Output is correct |
| 11 |
Correct |
2 ms |
200 KB |
Output is correct |
| 12 |
Correct |
1 ms |
200 KB |
Output is correct |
| 13 |
Correct |
2 ms |
200 KB |
Output is correct |
| 14 |
Correct |
1 ms |
200 KB |
Output is correct |
| 15 |
Correct |
2 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 |
2 ms |
200 KB |
Output is correct |
| 21 |
Correct |
1 ms |
200 KB |
Output is correct |
| 22 |
Correct |
2 ms |
220 KB |
Output is correct |
| 23 |
Correct |
1 ms |
240 KB |
Output is correct |
| 24 |
Correct |
2 ms |
200 KB |
Output is correct |
| 25 |
Correct |
2 ms |
200 KB |
Output is correct |
| 26 |
Correct |
2 ms |
200 KB |
Output is correct |
| 27 |
Correct |
2 ms |
200 KB |
Output is correct |
| 28 |
Correct |
3 ms |
200 KB |
Output is correct |
| 29 |
Correct |
2 ms |
200 KB |
Output is correct |
| 30 |
Correct |
2 ms |
200 KB |
Output is correct |
| 31 |
Correct |
2 ms |
200 KB |
Output is correct |
| 32 |
Correct |
2 ms |
200 KB |
Output is correct |
| 33 |
Correct |
2 ms |
200 KB |
Output is correct |
| 34 |
Correct |
2 ms |
200 KB |
Output is correct |
| 35 |
Correct |
2 ms |
200 KB |
Output is correct |
| 36 |
Correct |
1 ms |
200 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3074 ms |
200 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
