oj.uz

Submission #678757

# Submission time Handle Problem Language Result Execution time Memory
678757 2023-01-06T13:23:37 Z speedyArda Cave (IOI13_cave) C++14
100 / 100
 594 ms 600 KB 
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;
// Sol: Binary search queries on every element. // Apply reverse on left half -> If our door's state is changed that means we have our door in the left side of the array else it's on the right side
const int MAXN = 5005;
//int combination[MAXN];
//int switch_door[MAXN];
//int switch_status[MAXN];
void exploreCave(int N) {
    /* ... */
    vector<int> unused;
    int combination[N], switch_door[N], switch_status[N];
    for(int i = 0; i < N; i++) {
        unused.push_back(i);
        combination[i] = 0;
    }

    for(int door = 0; door < N; door++)
    {
        int tmp = tryCombination(combination);
        bool closed = false;
        if(tmp == door)
            closed = true;
        int l = 0, r = unused.size() - 1;
        int curr = 0;
        while(l <= r)
        {
            int m = (l + r) / 2;
            for(int i = l; i <= m; i++)
                combination[unused[i]] = 1;
            for(int i = m + 1; i <= r; i++)
                combination[unused[i]] = 0;
            int res = tryCombination(combination);
            if((!closed && res == door) || (closed && res != door))
            {
                r = m - 1;
                curr = unused[m];
            } else
            {
                l = m + 1;
            }

            for(int e : unused)
                combination[e] = 0;

        }

        switch_door[curr] = door;
        if(closed) {
            switch_status[curr] = 1;
            combination[curr] = 1;
        }
        else {
            switch_status[curr] = 0;
            combination[curr] = 0;
        }
        vector<int> temp;
        for(int e : unused)
        {
            if(e == curr)
                continue;
            temp.push_back(e);
        }
        unused = temp;
        for(int e : unused)
            combination[e] = 0;
    }

    answer(switch_status, switch_door);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 436 KB Output is correct
2 Correct 348 ms 340 KB Output is correct
3 Correct 535 ms 588 KB Output is correct
4 Correct 376 ms 468 KB Output is correct
5 Correct 535 ms 468 KB Output is correct
6 Correct 498 ms 484 KB Output is correct
7 Correct 551 ms 484 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 530 ms 468 KB Output is correct
13 Correct 536 ms 472 KB Output is correct
14 Correct 535 ms 480 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 534 ms 472 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 573 ms 472 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 563 ms 472 KB Output is correct
7 Correct 566 ms 476 KB Output is correct
8 Correct 581 ms 468 KB Output is correct
9 Correct 515 ms 480 KB Output is correct
10 Correct 585 ms 468 KB Output is correct
11 Correct 557 ms 468 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 87 ms 316 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 84 ms 372 KB Output is correct
24 Correct 84 ms 372 KB Output is correct
25 Correct 85 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 304 KB Output is correct
28 Correct 75 ms 368 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 84 ms 316 KB Output is correct
31 Correct 87 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 84 ms 372 KB Output is correct
36 Correct 77 ms 372 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 436 KB Output is correct
2 Correct 348 ms 340 KB Output is correct
3 Correct 535 ms 588 KB Output is correct
4 Correct 376 ms 468 KB Output is correct
5 Correct 535 ms 468 KB Output is correct
6 Correct 498 ms 484 KB Output is correct
7 Correct 551 ms 484 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 530 ms 468 KB Output is correct
13 Correct 536 ms 472 KB Output is correct
14 Correct 535 ms 480 KB Output is correct
15 Correct 534 ms 472 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 573 ms 472 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 563 ms 472 KB Output is correct
21 Correct 566 ms 476 KB Output is correct
22 Correct 581 ms 468 KB Output is correct
23 Correct 515 ms 480 KB Output is correct
24 Correct 585 ms 468 KB Output is correct
25 Correct 557 ms 468 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 296 KB Output is correct
45 Correct 87 ms 316 KB Output is correct
46 Correct 1 ms 308 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 84 ms 372 KB Output is correct
49 Correct 84 ms 372 KB Output is correct
50 Correct 85 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 304 KB Output is correct
53 Correct 75 ms 368 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 84 ms 316 KB Output is correct
56 Correct 87 ms 340 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 84 ms 372 KB Output is correct
61 Correct 77 ms 372 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 356 ms 468 KB Output is correct
64 Correct 337 ms 468 KB Output is correct
65 Correct 538 ms 516 KB Output is correct
66 Correct 349 ms 600 KB Output is correct
67 Correct 559 ms 508 KB Output is correct
68 Correct 516 ms 468 KB Output is correct
69 Correct 545 ms 504 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 544 ms 504 KB Output is correct
73 Correct 487 ms 504 KB Output is correct
74 Correct 560 ms 504 KB Output is correct
75 Correct 582 ms 512 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 581 ms 508 KB Output is correct
79 Correct 555 ms 508 KB Output is correct
80 Correct 516 ms 508 KB Output is correct
81 Correct 576 ms 508 KB Output is correct
82 Correct 568 ms 504 KB Output is correct
83 Correct 594 ms 508 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 87 ms 372 KB Output is correct
86 Correct 586 ms 508 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 304 KB Output is correct
89 Correct 87 ms 372 KB Output is correct
90 Correct 72 ms 384 KB Output is correct
91 Correct 84 ms 340 KB Output is correct
92 Correct 551 ms 504 KB Output is correct
93 Correct 567 ms 504 KB Output is correct
94 Correct 569 ms 468 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 571 ms 516 KB Output is correct
98 Correct 68 ms 340 KB Output is correct
99 Correct 539 ms 588 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 85 ms 372 KB Output is correct
102 Correct 87 ms 340 KB Output is correct
103 Correct 576 ms 504 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 304 KB Output is correct
107 Correct 85 ms 384 KB Output is correct
108 Correct 78 ms 376 KB Output is correct
109 Correct 552 ms 508 KB Output is correct
110 Correct 532 ms 508 KB Output is correct
111 Correct 0 ms 212 KB Output is correct