# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
311658 |
2020-10-10T22:07:21 Z |
saarang123 |
Cave (IOI13_cave) |
C++14 |
|
33 ms |
384 KB |
#include "cave.h"
void exploreCave(int n) {
int a[n], s[n], d[n];
for(int i = 0; i < n; i++)
a[i] = 0, s[i] = 0, d[i] = -1;
int x = tryCombination(a);
while(x != -1) {
int id;
int mn = 0, mx = n;
while(mn < mx) {
int mid = (mn + mx) >> 1;
//cout << "Binsearch: " << mn << " " << mid << " " << mx << endl;
for(int i = mn; i <= mid; i++)
if(d[i] == -1) a[i] ^= 1;
int k = tryCombination(a);
for(int i = mn; i <= mid; i++)
if(d[i] == -1) a[i] ^= 1;
if(k != x)
mx = mid;
else
mn = mid + 1;
}
id = mn;
//cout << "Binsearch end: " << id << " " << x << endl; cout << endl;
d[id] = x;
a[id] ^= 1;
x = tryCombination(a);
}
for(int i = 0; i < n; i++) s[i] = a[i];
//answer(s, d);
for(int i = 0; i < n; i++) {
if(d[i] != -1) continue;
s[i] ^= 1;
d[i] = tryCombination(s);
s[i] ^= 1;
}
answer(s, d);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
384 KB |
too much calls on tryCombination() |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
15 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
18 ms |
384 KB |
Output is correct |
7 |
Correct |
16 ms |
384 KB |
Output is correct |
8 |
Correct |
15 ms |
384 KB |
Output is correct |
9 |
Correct |
17 ms |
384 KB |
Output is correct |
10 |
Correct |
17 ms |
384 KB |
Output is correct |
11 |
Correct |
16 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Incorrect |
3 ms |
256 KB |
too much calls on tryCombination() |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Incorrect |
3 ms |
256 KB |
too much calls on tryCombination() |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
33 ms |
384 KB |
too much calls on tryCombination() |
2 |
Halted |
0 ms |
0 KB |
- |