#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
int open_comb[N];
int sw[N];
for(int i=0;i<N;i++) sw[i] = i;
int curr[N];
memset(curr,0,sizeof(curr));
for(int i=0;i<N;i++) {
int ans = tryCombination(curr);
if(ans > i || ans == -1) open_comb[i] = 0;
else if(ans == i) open_comb[i] = 1;
curr[i] = open_comb[i];
}
answer(open_comb, sw);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
640 KB |
Output is correct |
2 |
Correct |
16 ms |
524 KB |
Output is correct |
3 |
Correct |
21 ms |
516 KB |
Output is correct |
4 |
Correct |
17 ms |
524 KB |
Output is correct |
5 |
Correct |
27 ms |
512 KB |
Output is correct |
6 |
Correct |
16 ms |
460 KB |
Output is correct |
7 |
Correct |
26 ms |
640 KB |
Output is correct |
8 |
Correct |
6 ms |
512 KB |
Output is correct |
9 |
Correct |
6 ms |
512 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
460 KB |
Output is correct |
12 |
Correct |
25 ms |
512 KB |
Output is correct |
13 |
Correct |
21 ms |
572 KB |
Output is correct |
14 |
Correct |
17 ms |
524 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
33 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
3 |
Incorrect |
36 ms |
640 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
396 KB |
Output is correct |
2 |
Correct |
6 ms |
420 KB |
Output is correct |
3 |
Incorrect |
5 ms |
512 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
396 KB |
Output is correct |
2 |
Correct |
6 ms |
420 KB |
Output is correct |
3 |
Incorrect |
5 ms |
512 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
640 KB |
Output is correct |
2 |
Correct |
16 ms |
524 KB |
Output is correct |
3 |
Correct |
21 ms |
516 KB |
Output is correct |
4 |
Correct |
17 ms |
524 KB |
Output is correct |
5 |
Correct |
27 ms |
512 KB |
Output is correct |
6 |
Correct |
16 ms |
460 KB |
Output is correct |
7 |
Correct |
26 ms |
640 KB |
Output is correct |
8 |
Correct |
6 ms |
512 KB |
Output is correct |
9 |
Correct |
6 ms |
512 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
460 KB |
Output is correct |
12 |
Correct |
25 ms |
512 KB |
Output is correct |
13 |
Correct |
21 ms |
572 KB |
Output is correct |
14 |
Correct |
17 ms |
524 KB |
Output is correct |
15 |
Correct |
33 ms |
512 KB |
Output is correct |
16 |
Correct |
5 ms |
512 KB |
Output is correct |
17 |
Incorrect |
36 ms |
640 KB |
Answer is wrong |
18 |
Halted |
0 ms |
0 KB |
- |