# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
520991 |
2022-01-31T15:28:12 Z |
FulopMate |
Cave (IOI13_cave) |
C++17 |
|
17 ms |
412 KB |
#include "cave.h"
void exploreCave(int N) {
int S[5000] = {};
for(int i = 0; i < N; i++){
if(tryCombination(S) == i){
S[i] = 1;
}
}
int D[5000];
for(int i = 0; i < N; i++){
D[i] = i;
}
answer(S, D);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
296 KB |
Output is correct |
2 |
Correct |
6 ms |
276 KB |
Output is correct |
3 |
Correct |
8 ms |
292 KB |
Output is correct |
4 |
Correct |
6 ms |
332 KB |
Output is correct |
5 |
Correct |
17 ms |
348 KB |
Output is correct |
6 |
Correct |
11 ms |
412 KB |
Output is correct |
7 |
Correct |
15 ms |
332 KB |
Output is correct |
8 |
Correct |
0 ms |
280 KB |
Output is correct |
9 |
Correct |
0 ms |
332 KB |
Output is correct |
10 |
Correct |
0 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
8 ms |
332 KB |
Output is correct |
13 |
Correct |
8 ms |
400 KB |
Output is correct |
14 |
Correct |
8 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
292 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
16 ms |
296 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
332 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
1 ms |
332 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
296 KB |
Output is correct |
2 |
Correct |
6 ms |
276 KB |
Output is correct |
3 |
Correct |
8 ms |
292 KB |
Output is correct |
4 |
Correct |
6 ms |
332 KB |
Output is correct |
5 |
Correct |
17 ms |
348 KB |
Output is correct |
6 |
Correct |
11 ms |
412 KB |
Output is correct |
7 |
Correct |
15 ms |
332 KB |
Output is correct |
8 |
Correct |
0 ms |
280 KB |
Output is correct |
9 |
Correct |
0 ms |
332 KB |
Output is correct |
10 |
Correct |
0 ms |
332 KB |
Output is correct |
11 |
Correct |
0 ms |
332 KB |
Output is correct |
12 |
Correct |
8 ms |
332 KB |
Output is correct |
13 |
Correct |
8 ms |
400 KB |
Output is correct |
14 |
Correct |
8 ms |
332 KB |
Output is correct |
15 |
Correct |
16 ms |
292 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Incorrect |
16 ms |
296 KB |
Answer is wrong |
18 |
Halted |
0 ms |
0 KB |
- |