# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
945439 |
2024-03-13T19:25:16 Z |
codefox |
Cave (IOI13_cave) |
C++14 |
|
216 ms |
604 KB |
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
const int M = 1<<13;
void exploreCave(int N) {
int b[N];
int ans[N];
for (int i = 0; i < N; i++)
{
b[i] = 0;
ans[i] = -1;
}
int f = tryCombination(b);
for (int i = 0; i < N; i++)
{
if (f !=i)
{
for (int j = 0; j < N; j++)
{
if (ans[j]==-1) b[j] = 1-b[j];
}
}
int curr = 0;
for (int j = 12; j >= 0; j--)
{
for (int k = curr; k < curr + (1<<j) && k <N; k++)
{
if (ans[k]==-1) b[k] = 1-b[k];
}
int h = tryCombination(b);
for (int k = curr; k < curr + (1<<j) && k <N; k++)
{
if (ans[k]==-1) b[k] = 1-b[k];
}
if (h != i) continue;
curr += 1<<j;
}
b[curr] = 1-b[curr];
ans[curr] = i;
f = tryCombination(b);
}
answer(b, ans);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
132 ms |
348 KB |
Output is correct |
2 |
Correct |
126 ms |
348 KB |
Output is correct |
3 |
Correct |
177 ms |
540 KB |
Output is correct |
4 |
Correct |
139 ms |
520 KB |
Output is correct |
5 |
Incorrect |
216 ms |
348 KB |
too much calls on tryCombination() |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
188 ms |
516 KB |
too much calls on tryCombination() |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
368 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
604 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
368 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
604 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
0 ms |
600 KB |
Output is correct |
16 |
Correct |
0 ms |
344 KB |
Output is correct |
17 |
Correct |
1 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
38 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
348 KB |
Output is correct |
22 |
Correct |
1 ms |
348 KB |
Output is correct |
23 |
Correct |
55 ms |
468 KB |
Output is correct |
24 |
Correct |
55 ms |
344 KB |
Output is correct |
25 |
Correct |
62 ms |
472 KB |
Output is correct |
26 |
Correct |
1 ms |
348 KB |
Output is correct |
27 |
Correct |
1 ms |
348 KB |
Output is correct |
28 |
Correct |
43 ms |
344 KB |
Output is correct |
29 |
Correct |
1 ms |
344 KB |
Output is correct |
30 |
Correct |
37 ms |
344 KB |
Output is correct |
31 |
Correct |
37 ms |
348 KB |
Output is correct |
32 |
Correct |
1 ms |
344 KB |
Output is correct |
33 |
Correct |
1 ms |
348 KB |
Output is correct |
34 |
Correct |
1 ms |
348 KB |
Output is correct |
35 |
Correct |
52 ms |
468 KB |
Output is correct |
36 |
Correct |
50 ms |
348 KB |
Output is correct |
37 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
132 ms |
348 KB |
Output is correct |
2 |
Correct |
126 ms |
348 KB |
Output is correct |
3 |
Correct |
177 ms |
540 KB |
Output is correct |
4 |
Correct |
139 ms |
520 KB |
Output is correct |
5 |
Incorrect |
216 ms |
348 KB |
too much calls on tryCombination() |
6 |
Halted |
0 ms |
0 KB |
- |