oj.uz

Submission #309363

# Submission time Handle Problem Language Result Execution time Memory
309363 2020-10-03T10:18:56 Z mihai145 Cave (IOI13_cave) C++14
51 / 100
 386 ms 65540 KB 
#include "cave.h"

void exploreCave(int N) {
    int *correctPos = new int[N];
    int *door = new int[N];
    bool *stablePos = new bool[N];

    for(int i = 0; i < N; i++)
        {
            correctPos[i] = 0;
            door[i] = 0;
            stablePos[i] = 0;
        }

    int currentPosition = 0;

    for(int d = 0; d < N; d++)
        {
            int r = tryCombination(correctPos);
            if(r != d)
                {
                    currentPosition = 1 - currentPosition;

                    for(int i = 0; i < N; i++)
                        if(!stablePos[i])
                            correctPos[i] = 1 - correctPos[i];
                }

            ///pozitia corecta pentru a deschide usa d este 1 - currentPosition

            int *auxarr = new int[N];
            for(int i = 0; i < N; i++)
                auxarr[i] = 0;

            int st = 0, dr = N - 1;
            while(st < dr)
                {
                    int mid = (st + dr) >> 1;

                    for(int i = 0; i < N; i++)
                        if(stablePos[i]) auxarr[i] = correctPos[i];
                        else if(st <= i && i <= mid) auxarr[i] = 1 - currentPosition;
                        else auxarr[i] = currentPosition;

                    r = tryCombination(auxarr);

                    if(r != d)
                        {
                            ///pozitia corecta e in st...mid
                            dr = mid;
                        }
                    else
                        {
                            ///pozitia corecta e in mid+1...dr
                            st = mid + 1;
                        }
                }

            stablePos[st] = 1;
            correctPos[st] = 1 - currentPosition;
            door[st] = d;
        }

    answer(correctPos, door);
    delete[] correctPos;
    delete[] door;
    delete[] stablePos;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 386 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 373 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 79 ms 16080 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 133 ms 15992 KB Output is correct
24 Correct 138 ms 16120 KB Output is correct
25 Correct 135 ms 15992 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 90 ms 16012 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 87 ms 15992 KB Output is correct
31 Correct 88 ms 15992 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 135 ms 16024 KB Output is correct
36 Correct 133 ms 15992 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 386 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -