Submission #309364

# Submission time Handle Problem Language Result Execution time Memory
309364 2020-10-03T10:23:19 Z mihai145 Cave (IOI13_cave) C++14
100 / 100
996 ms 628 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;
                        }
                }

            delete[] auxarr;

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

    answer(correctPos, door);
    delete[] correctPos;
    delete[] door;
    delete[] stablePos;
}
# Verdict Execution time Memory Grader output
1 Correct 328 ms 504 KB Output is correct
2 Correct 338 ms 384 KB Output is correct
3 Correct 496 ms 504 KB Output is correct
4 Correct 351 ms 504 KB Output is correct
5 Correct 504 ms 384 KB Output is correct
6 Correct 533 ms 500 KB Output is correct
7 Correct 535 ms 504 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 520 ms 504 KB Output is correct
13 Correct 509 ms 504 KB Output is correct
14 Correct 527 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 503 ms 512 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 500 ms 628 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 556 ms 384 KB Output is correct
7 Correct 542 ms 508 KB Output is correct
8 Correct 960 ms 504 KB Output is correct
9 Correct 949 ms 504 KB Output is correct
10 Correct 955 ms 504 KB Output is correct
11 Correct 470 ms 504 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 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 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 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 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 256 KB Output is correct
20 Correct 69 ms 384 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 123 ms 384 KB Output is correct
24 Correct 124 ms 504 KB Output is correct
25 Correct 124 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 81 ms 384 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 79 ms 404 KB Output is correct
31 Correct 77 ms 384 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 124 ms 384 KB Output is correct
36 Correct 118 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 328 ms 504 KB Output is correct
2 Correct 338 ms 384 KB Output is correct
3 Correct 496 ms 504 KB Output is correct
4 Correct 351 ms 504 KB Output is correct
5 Correct 504 ms 384 KB Output is correct
6 Correct 533 ms 500 KB Output is correct
7 Correct 535 ms 504 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 520 ms 504 KB Output is correct
13 Correct 509 ms 504 KB Output is correct
14 Correct 527 ms 504 KB Output is correct
15 Correct 503 ms 512 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 500 ms 628 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 556 ms 384 KB Output is correct
21 Correct 542 ms 508 KB Output is correct
22 Correct 960 ms 504 KB Output is correct
23 Correct 949 ms 504 KB Output is correct
24 Correct 955 ms 504 KB Output is correct
25 Correct 470 ms 504 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 0 ms 256 KB Output is correct
41 Correct 0 ms 256 KB Output is correct
42 Correct 0 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 1 ms 256 KB Output is correct
45 Correct 69 ms 384 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 123 ms 384 KB Output is correct
49 Correct 124 ms 504 KB Output is correct
50 Correct 124 ms 384 KB Output is correct
51 Correct 1 ms 256 KB Output is correct
52 Correct 1 ms 256 KB Output is correct
53 Correct 81 ms 384 KB Output is correct
54 Correct 1 ms 256 KB Output is correct
55 Correct 79 ms 404 KB Output is correct
56 Correct 77 ms 384 KB Output is correct
57 Correct 1 ms 256 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 124 ms 384 KB Output is correct
61 Correct 118 ms 384 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 322 ms 536 KB Output is correct
64 Correct 341 ms 504 KB Output is correct
65 Correct 517 ms 504 KB Output is correct
66 Correct 355 ms 504 KB Output is correct
67 Correct 511 ms 508 KB Output is correct
68 Correct 562 ms 504 KB Output is correct
69 Correct 515 ms 500 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 497 ms 504 KB Output is correct
73 Correct 511 ms 504 KB Output is correct
74 Correct 521 ms 512 KB Output is correct
75 Correct 491 ms 512 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 553 ms 504 KB Output is correct
79 Correct 540 ms 504 KB Output is correct
80 Correct 950 ms 504 KB Output is correct
81 Correct 948 ms 504 KB Output is correct
82 Correct 972 ms 504 KB Output is correct
83 Correct 458 ms 504 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 70 ms 416 KB Output is correct
86 Correct 468 ms 500 KB Output is correct
87 Correct 1 ms 256 KB Output is correct
88 Correct 1 ms 256 KB Output is correct
89 Correct 121 ms 384 KB Output is correct
90 Correct 126 ms 384 KB Output is correct
91 Correct 123 ms 384 KB Output is correct
92 Correct 995 ms 504 KB Output is correct
93 Correct 992 ms 384 KB Output is correct
94 Correct 996 ms 560 KB Output is correct
95 Correct 1 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 510 ms 504 KB Output is correct
98 Correct 81 ms 384 KB Output is correct
99 Correct 564 ms 504 KB Output is correct
100 Correct 1 ms 256 KB Output is correct
101 Correct 81 ms 384 KB Output is correct
102 Correct 76 ms 384 KB Output is correct
103 Correct 471 ms 504 KB Output is correct
104 Correct 1 ms 256 KB Output is correct
105 Correct 1 ms 256 KB Output is correct
106 Correct 1 ms 256 KB Output is correct
107 Correct 124 ms 416 KB Output is correct
108 Correct 119 ms 508 KB Output is correct
109 Correct 996 ms 504 KB Output is correct
110 Correct 973 ms 504 KB Output is correct
111 Correct 0 ms 256 KB Output is correct