Submission #945443

# Submission time Handle Problem Language Result Execution time Memory
945443 2024-03-13T19:28:51 Z codefox Cave (IOI13_cave) C++14
51 / 100
224 ms 592 KB
#include<bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int b[N];
    int ans[N];

    for (int i = 0; i < N; i++)
    {
        b[i] = 0;
        ans[i] = -1;
    }
    int l = 2;
    int n = N;
    while (n)
    {
        n/=2;
        l++;
    }

    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 = l; 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 158 ms 492 KB Output is correct
2 Correct 186 ms 592 KB Output is correct
3 Incorrect 220 ms 504 KB too much calls on tryCombination()
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 224 ms 504 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 500 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 37 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 53 ms 348 KB Output is correct
24 Correct 58 ms 348 KB Output is correct
25 Correct 60 ms 456 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 39 ms 476 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 40 ms 348 KB Output is correct
31 Correct 46 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 56 ms 348 KB Output is correct
36 Correct 52 ms 456 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 158 ms 492 KB Output is correct
2 Correct 186 ms 592 KB Output is correct
3 Incorrect 220 ms 504 KB too much calls on tryCombination()
4 Halted 0 ms 0 KB -