Submission #839283

# Submission time Handle Problem Language Result Execution time Memory
839283 2023-08-29T14:07:21 Z Alfraganus Cave (IOI13_cave) C++17
100 / 100
211 ms 524 KB
#include "cave.h"
// #include "grader.c"
#include <vector>
using namespace std;

bool used[5001];
int bits[5001], a[5001];

bool check(int l, int r){
    for(int i = l; i <= r; i ++)
        if(!used[i])
            return false;
    return true;
}

void color(int l, int r, int x){
    for(int i = l; i <= r; i ++)
        if(!used[i])
            bits[i] = x;
}

void exploreCave(int n){
    for(int i = 0; i < n; i ++){
        int l = 0, r = n - 1;
        int x = -1;
        while(l < r){
            int m = (l + r) >> 1;
            if(check(l, m))
                l = m + 1;
            else if(check(m + 1, r))
                r = m;
            else{
                color(l, m, 0);
                color(m + 1, r, 1);
                int k = tryCombination(bits);
                // printf("%d ", l);
                // printf("%d ", m);
                // printf("%d ", r);
                // printf("%d ", x);
                // printf("%d ", k);
                // for(int i = 0; i < n; i ++)
                //     printf("%d ", bits[i]);
                // printf("\n");
                if(x == -1){
                    if(k > i or k == -1){
                        color(m + 1, r, 0);
                        int k = tryCombination(bits);
                        if(k > i or k == -1)
                            x = 0, r = m;
                        else
                            x = 1, l = m + 1;
                    }
                    else{
                        color(m + 1, r, 0);
                        int k = tryCombination(bits);
                        if (k > i or k == -1)
                            x = 0, l = m + 1;
                        else
                            x = 1, r = m;
                    }
                }
                else{
                    if(x == 0){
                        if(k > i or k == -1)
                            r = m;
                        else
                            l = m + 1;
                    }
                    else{
                        if(k > i or k == -1)
                            l = m + 1;
                        else
                            r = m;
                    }
                }
            }
        }
        if(i == n - 1){
            color(0, n - 1, 0);
            x = 0;
            if(tryCombination(bits) != -1)
                x = 1;
        }
        used[l] = true;
        bits[l] = x;
        a[l] = i;
    }
    answer(bits, a);
}
# Verdict Execution time Memory Grader output
1 Correct 49 ms 340 KB Output is correct
2 Correct 48 ms 392 KB Output is correct
3 Correct 71 ms 340 KB Output is correct
4 Correct 50 ms 384 KB Output is correct
5 Correct 83 ms 404 KB Output is correct
6 Correct 74 ms 340 KB Output is correct
7 Correct 83 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 73 ms 412 KB Output is correct
13 Correct 78 ms 396 KB Output is correct
14 Correct 76 ms 404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 83 ms 376 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 116 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 101 ms 372 KB Output is correct
7 Correct 107 ms 340 KB Output is correct
8 Correct 205 ms 368 KB Output is correct
9 Correct 205 ms 428 KB Output is correct
10 Correct 194 ms 464 KB Output is correct
11 Correct 78 ms 360 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 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 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 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 0 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 336 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 12 ms 356 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 292 KB Output is correct
23 Correct 24 ms 360 KB Output is correct
24 Correct 25 ms 340 KB Output is correct
25 Correct 25 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 15 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 16 ms 468 KB Output is correct
31 Correct 12 ms 340 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 25 ms 340 KB Output is correct
36 Correct 26 ms 468 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 49 ms 340 KB Output is correct
2 Correct 48 ms 392 KB Output is correct
3 Correct 71 ms 340 KB Output is correct
4 Correct 50 ms 384 KB Output is correct
5 Correct 83 ms 404 KB Output is correct
6 Correct 74 ms 340 KB Output is correct
7 Correct 83 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 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 73 ms 412 KB Output is correct
13 Correct 78 ms 396 KB Output is correct
14 Correct 76 ms 404 KB Output is correct
15 Correct 83 ms 376 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 116 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 101 ms 372 KB Output is correct
21 Correct 107 ms 340 KB Output is correct
22 Correct 205 ms 368 KB Output is correct
23 Correct 205 ms 428 KB Output is correct
24 Correct 194 ms 464 KB Output is correct
25 Correct 78 ms 360 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 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 0 ms 212 KB Output is correct
33 Correct 0 ms 212 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 0 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 336 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 292 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 12 ms 356 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 292 KB Output is correct
48 Correct 24 ms 360 KB Output is correct
49 Correct 25 ms 340 KB Output is correct
50 Correct 25 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 15 ms 340 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 16 ms 468 KB Output is correct
56 Correct 12 ms 340 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 25 ms 340 KB Output is correct
61 Correct 26 ms 468 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 48 ms 340 KB Output is correct
64 Correct 52 ms 516 KB Output is correct
65 Correct 72 ms 404 KB Output is correct
66 Correct 49 ms 388 KB Output is correct
67 Correct 86 ms 400 KB Output is correct
68 Correct 72 ms 396 KB Output is correct
69 Correct 84 ms 392 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 72 ms 340 KB Output is correct
73 Correct 75 ms 400 KB Output is correct
74 Correct 73 ms 404 KB Output is correct
75 Correct 123 ms 460 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 104 ms 392 KB Output is correct
79 Correct 112 ms 524 KB Output is correct
80 Correct 199 ms 340 KB Output is correct
81 Correct 211 ms 396 KB Output is correct
82 Correct 198 ms 464 KB Output is correct
83 Correct 79 ms 400 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 12 ms 340 KB Output is correct
86 Correct 73 ms 340 KB Output is correct
87 Correct 0 ms 280 KB Output is correct
88 Correct 1 ms 296 KB Output is correct
89 Correct 24 ms 340 KB Output is correct
90 Correct 31 ms 340 KB Output is correct
91 Correct 24 ms 340 KB Output is correct
92 Correct 191 ms 400 KB Output is correct
93 Correct 188 ms 400 KB Output is correct
94 Correct 191 ms 400 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 97 ms 400 KB Output is correct
98 Correct 14 ms 340 KB Output is correct
99 Correct 94 ms 388 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 15 ms 340 KB Output is correct
102 Correct 12 ms 360 KB Output is correct
103 Correct 71 ms 516 KB Output is correct
104 Correct 1 ms 288 KB Output is correct
105 Correct 3 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 24 ms 340 KB Output is correct
108 Correct 25 ms 464 KB Output is correct
109 Correct 194 ms 400 KB Output is correct
110 Correct 187 ms 400 KB Output is correct
111 Correct 0 ms 212 KB Output is correct