oj.uz

Submission #703325

# Submission time Handle Problem Language Result Execution time Memory
703325 2023-02-27T03:53:35 Z SamNguyen Cave (IOI13_cave) C++14
100 / 100
 228 ms 544 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX = 5000 + 7;
int swit[MAX], door[MAX];

namespace Subtask1 {
    bool exploreCave(int N) {
        iota(door, door + N, 0);
        fill(swit, swit + N, 0);

        int cnt = 0;
        while (cnt <= N) {
            int i = tryCombination(swit);
            if (i == -1) {
                answer(swit, door);
                return true;
            }
            swit[i] ^= 1;
            cnt++;
        }

        return false;
    }
}

namespace Subtask2 {
    bool exploreCave(int N) {
        fill(swit, swit + N, 0);

        for (int i = 0; i < N; i++) {
            swit[i] = 1;
            door[i] = tryCombination(swit);
            swit[i] = 0;
        }
        answer(swit, door);

        return true;
    }
}

namespace Subtask3 {
    bool exploreCave(int N) {
        mt19937 rnd(20050701);
        generate(swit, swit + N, [&]() {
            return rnd() & 1;
        });

        int p = tryCombination(swit);
        while (p != -1) {
            for (int i = 0; i < N; i++) {
                swit[i] ^= 1;
                int p2 = tryCombination(swit);
                if (p2 > p or p2 == -1) {
                    p = p2;
                    break;
                }
                swit[i] ^= 1;
            }
        }

        for (int i = 0; i < N; i++) {
            swit[i] ^= 1;
            door[i] = tryCombination(swit);
            swit[i] ^= 1;
        }
        answer(swit, door);

        return true;
    }
}

namespace Subtask4 {
    mt19937 rnd(20050701);
    bool is_fixed[MAX];

    int INIT_COMB;

    pair<int, int> find_switch_for_door(int i, int l, int r) {
        if (l == r) {
            if (not is_fixed[r])
                swit[r] ^= 1;
            int p = tryCombination(swit);
//            cerr << "try " << i << " " << l << " " << r << " -> " << p << endl;
            if (not is_fixed[r])
                swit[r] ^= 1;

            if (p == i)
                return make_pair(swit[r], r);

            INIT_COMB = p;
            return make_pair(swit[r] ^ 1, r);
        }

        int p1 = INIT_COMB;
        int m = (l + r) >> 1;

        bool ok = false;
        for (int x = l; x <= m; x++) if (not is_fixed[x]) {
            swit[x] ^= 1;
            ok = true;
        }

        int p2 = ok ? tryCombination(swit) : p1;
        for (int x = l; x <= m; x++) if (not is_fixed[x])
            swit[x] ^= 1;

        if ((p1 == i) xor (p2 == i))
            return find_switch_for_door(i, l, m);
        return find_switch_for_door(i, m + 1, r);
    }

    bool exploreCave(int N) {
        fill(is_fixed, is_fixed + N, false);

        INIT_COMB = tryCombination(swit);
        for (int i = 0; i < N; i++) {
            int res, p;
            tie(res, p) = find_switch_for_door(i, 0, N - 1);
            door[p] = i;
            swit[p] = res;
            is_fixed[p] = true;
        }

        answer(swit, door);
        return true;
    }
}

void exploreCave(int N) {
    Subtask4::exploreCave(N);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 340 KB Output is correct
2 Correct 66 ms 384 KB Output is correct
3 Correct 94 ms 380 KB Output is correct
4 Correct 66 ms 372 KB Output is correct
5 Correct 94 ms 460 KB Output is correct
6 Correct 95 ms 380 KB Output is correct
7 Correct 94 ms 380 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 1 ms 212 KB Output is correct
12 Correct 103 ms 380 KB Output is correct
13 Correct 92 ms 380 KB Output is correct
14 Correct 91 ms 384 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 380 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 146 ms 392 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 107 ms 376 KB Output is correct
7 Correct 135 ms 384 KB Output is correct
8 Correct 208 ms 424 KB Output is correct
9 Correct 227 ms 424 KB Output is correct
10 Correct 209 ms 328 KB Output is correct
11 Correct 142 ms 412 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 20 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 28 ms 340 KB Output is correct
24 Correct 31 ms 352 KB Output is correct
25 Correct 28 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 16 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 20 ms 364 KB Output is correct
31 Correct 20 ms 360 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 29 ms 340 KB Output is correct
36 Correct 29 ms 340 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 59 ms 340 KB Output is correct
2 Correct 66 ms 384 KB Output is correct
3 Correct 94 ms 380 KB Output is correct
4 Correct 66 ms 372 KB Output is correct
5 Correct 94 ms 460 KB Output is correct
6 Correct 95 ms 380 KB Output is correct
7 Correct 94 ms 380 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 1 ms 212 KB Output is correct
12 Correct 103 ms 380 KB Output is correct
13 Correct 92 ms 380 KB Output is correct
14 Correct 91 ms 384 KB Output is correct
15 Correct 114 ms 380 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 146 ms 392 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 107 ms 376 KB Output is correct
21 Correct 135 ms 384 KB Output is correct
22 Correct 208 ms 424 KB Output is correct
23 Correct 227 ms 424 KB Output is correct
24 Correct 209 ms 328 KB Output is correct
25 Correct 142 ms 412 KB Output is correct
26 Correct 0 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 0 ms 212 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 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 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 20 ms 340 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 28 ms 340 KB Output is correct
49 Correct 31 ms 352 KB Output is correct
50 Correct 28 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 16 ms 340 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 20 ms 364 KB Output is correct
56 Correct 20 ms 360 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 29 ms 340 KB Output is correct
61 Correct 29 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 67 ms 420 KB Output is correct
64 Correct 62 ms 408 KB Output is correct
65 Correct 95 ms 420 KB Output is correct
66 Correct 66 ms 400 KB Output is correct
67 Correct 92 ms 420 KB Output is correct
68 Correct 99 ms 544 KB Output is correct
69 Correct 99 ms 416 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 316 KB Output is correct
72 Correct 94 ms 420 KB Output is correct
73 Correct 91 ms 416 KB Output is correct
74 Correct 96 ms 376 KB Output is correct
75 Correct 143 ms 424 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 132 ms 412 KB Output is correct
79 Correct 131 ms 420 KB Output is correct
80 Correct 205 ms 424 KB Output is correct
81 Correct 228 ms 340 KB Output is correct
82 Correct 207 ms 428 KB Output is correct
83 Correct 138 ms 412 KB Output is correct
84 Correct 0 ms 340 KB Output is correct
85 Correct 20 ms 340 KB Output is correct
86 Correct 131 ms 412 KB Output is correct
87 Correct 0 ms 340 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 29 ms 340 KB Output is correct
90 Correct 29 ms 340 KB Output is correct
91 Correct 29 ms 340 KB Output is correct
92 Correct 207 ms 428 KB Output is correct
93 Correct 211 ms 420 KB Output is correct
94 Correct 206 ms 424 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 127 ms 328 KB Output is correct
98 Correct 16 ms 340 KB Output is correct
99 Correct 100 ms 336 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 22 ms 340 KB Output is correct
102 Correct 20 ms 332 KB Output is correct
103 Correct 132 ms 428 KB Output is correct
104 Correct 1 ms 316 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 316 KB Output is correct
107 Correct 29 ms 340 KB Output is correct
108 Correct 29 ms 360 KB Output is correct
109 Correct 215 ms 420 KB Output is correct
110 Correct 209 ms 460 KB Output is correct
111 Correct 0 ms 212 KB Output is correct