# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
29818 |
2017-07-21T07:53:32 Z |
kavun |
Cave (IOI13_cave) |
C++14 |
|
21 ms |
640 KB |
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
int n, s[5010], firstclosed, d[5010], correct[5010], done;
bool mk[5010];
void exploreCave(int N) {
n = N;
for(int i = 0; done < n; i = (i+1) % n)
{
if(mk[i]) continue;
s[i] ^= 1;
int pos = tryCombination(s);
if(pos == -1)
{
correct[i] = s[i];
d[i] = firstclosed;
done++;
firstclosed = n;
mk[i] = true;
continue;
}
if(pos < firstclosed)
{
correct[i] = s[i] ^ 1;
d[i] = pos;
done++;
s[i] ^= 1;
mk[i] = true;
}
if(pos > firstclosed)
{
correct[i] = s[i];
d[i] = firstclosed;
done++;
firstclosed = pos;
mk[i] = true;
}
}
for(int i = 0; i < n; i++)
s[i] = correct[i];
answer(s,d);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
524 KB |
Output is correct |
2 |
Correct |
16 ms |
640 KB |
Output is correct |
3 |
Correct |
19 ms |
640 KB |
Output is correct |
4 |
Correct |
15 ms |
500 KB |
Output is correct |
5 |
Correct |
20 ms |
512 KB |
Output is correct |
6 |
Correct |
17 ms |
524 KB |
Output is correct |
7 |
Correct |
16 ms |
512 KB |
Output is correct |
8 |
Correct |
5 ms |
512 KB |
Output is correct |
9 |
Correct |
6 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
400 KB |
Output is correct |
11 |
Correct |
5 ms |
512 KB |
Output is correct |
12 |
Correct |
21 ms |
640 KB |
Output is correct |
13 |
Correct |
17 ms |
640 KB |
Output is correct |
14 |
Correct |
17 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
640 KB |
Output is correct |
2 |
Correct |
7 ms |
512 KB |
Output is correct |
3 |
Correct |
16 ms |
512 KB |
Output is correct |
4 |
Incorrect |
5 ms |
512 KB |
Answer is wrong |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Incorrect |
5 ms |
384 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Incorrect |
5 ms |
384 KB |
Answer is wrong |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
524 KB |
Output is correct |
2 |
Correct |
16 ms |
640 KB |
Output is correct |
3 |
Correct |
19 ms |
640 KB |
Output is correct |
4 |
Correct |
15 ms |
500 KB |
Output is correct |
5 |
Correct |
20 ms |
512 KB |
Output is correct |
6 |
Correct |
17 ms |
524 KB |
Output is correct |
7 |
Correct |
16 ms |
512 KB |
Output is correct |
8 |
Correct |
5 ms |
512 KB |
Output is correct |
9 |
Correct |
6 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
400 KB |
Output is correct |
11 |
Correct |
5 ms |
512 KB |
Output is correct |
12 |
Correct |
21 ms |
640 KB |
Output is correct |
13 |
Correct |
17 ms |
640 KB |
Output is correct |
14 |
Correct |
17 ms |
512 KB |
Output is correct |
15 |
Correct |
19 ms |
640 KB |
Output is correct |
16 |
Correct |
7 ms |
512 KB |
Output is correct |
17 |
Correct |
16 ms |
512 KB |
Output is correct |
18 |
Incorrect |
5 ms |
512 KB |
Answer is wrong |
19 |
Halted |
0 ms |
0 KB |
- |