# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
104439 |
2019-04-06T20:48:37 Z |
Badral |
Cave (IOI13_cave) |
C++17 |
|
6 ms |
512 KB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int a[N+1];
int d[N+1];
memset(a, 0, sizeof(a));
for(int i = 0; i < N; i++) {
d[i] = i;
if(tryCombination(a) == i) {
continue;
}else {
a[i] = 1;
}
}
answer(a, d);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
512 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
384 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
512 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
512 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
512 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |