# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
764627 |
2023-06-23T16:47:46 Z |
hfoliacots |
Cave (IOI13_cave) |
C++14 |
|
1 ms |
340 KB |
#include <bits/stdc++.h>
#include "cave.h"
void exploreCave(int N) {
using namespace std;
int s[N], d[N];
vector<bool> vis(N, false);
memset(s, 0, sizeof s);
int pant, p = tryCombination(s);
int l = 0, r = N-1, mid = (l+r)/2;
for (int k = 0; k < N; k++) {
while (l < r) {
for (int i = l; i <= mid; i++) {
if (!vis[i]) s[i] = !s[i];
}
pant = p;
p = tryCombination(s);
if (p == k && pant == k) l = mid+1;
else if (p != k && pant != k) l = mid+1;
else r = mid;
mid = (l+r)/2;
}
d[r] = k;
vis[r] = true;
if (p == k) s[r] = !s[r];
}
answer(s, d);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Answer is wrong |
2 |
Halted |
0 ms |
0 KB |
- |