# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
514194 |
2022-01-18T05:10:49 Z |
thegrimbee |
Cave (IOI13_cave) |
C++14 |
|
29 ms |
460 KB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int S[N], D[N], visited[N], ans[N], temp[N];
int lo, hi, mid, cur;
for (int i = 1; i <= N; ++i){
lo = 0;hi = N;mid = (lo + hi)/2;
copy(ans, ans + N, temp);
if (tryCombination(temp) == i)cur = 0;
else cur = 1;
while (lo != mid){
if (cur){
for (int i = lo; i < mid; ++i){
if (!visited[i])temp[i] = 1;
}
}
else{
for (int i = mid; i < hi; ++i){
if (!visited[i])temp[i] = 1;
}
}
if (tryCombination(temp) == i)hi=mid;
else lo = mid;
mid = (lo + hi)/2;
}
visited[mid] = 1;
ans[mid] = cur;
S[i-1] = cur;
D[i-1] = mid;
}
answer(S, D);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
324 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
29 ms |
460 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
324 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |