oj.uz

Submission #599236

# Submission time Handle Problem Language Result Execution time Memory
599236 2022-07-19T11:53:40 Z alextodoran Uplifting Excursion (BOI22_vault) C++17
30 / 100
 5000 ms 173028 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int BITS = 60;
const ll INF = LLONG_MAX / 2;

int M;
ll L;
int* A[BITS];

int S;
ll* maxTake[BITS];
ll* maxTakeBit;

void init () {
    for (int bit = 0; bit < BITS; bit++) {
        A[bit] = new int[M * 2 + 1] + M;
        maxTake[bit] = new ll[S * 2 + 1] + S;
        fill(A[bit] - M, A[bit] + M + 1, 0);
        fill(maxTake[bit] - S, maxTake[bit] + S + 1, -INF);
    }
    maxTakeBit = new ll[S * 2 + 1] + S;
}

void solveBit (int bit) {
    fill(maxTakeBit - S, maxTakeBit + S + 1, -INF);
    maxTakeBit[0] = 0;
    for (int l = -M; l <= M; l++) {
        if (l < 0) {
            for (int i = 1; i <= A[bit][l]; i++) {
                for (int s = -S - l; s <= +S; s++) {
                    if (maxTakeBit[s] != -INF) {
                        maxTakeBit[s + l] = max(maxTakeBit[s + l], maxTakeBit[s] + 1);
                    }
                }
            }
        } else {
            for (int i = 1; i <= A[bit][l]; i++) {
                for (int s = +S - l; s >= -S; s--) {
                    if (maxTakeBit[s] != -INF) {
                        maxTakeBit[s + l] = max(maxTakeBit[s + l], maxTakeBit[s] + 1);
                    }
                }
            }
        }
    }
}

void update (ll &x, const ll &y) {
    if (y > x) {
        x = y;
    }
}

mt19937 rnd(0);

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> M >> L;
    S = M * (M + 1) * 2;
    init();
    for (int l = -M; l <= +M; l++) {
        ll cnt; cin >> cnt;
        int bit = 0;
        while (((ll) 1 << bit) <= cnt) {
            cnt -= ((ll) 1 << bit);
            A[bit][l]++;
            bit++;
        }
        for (int bit = 0; bit < BITS; bit++) {
            if ((cnt >> bit) & 1) {
                A[bit][l]++;
            }
        }
    }

    solveBit(0);
    for (int here = -S; here <= +S; here++) {
        int sum = here - (L & 1);
        if (sum % 2 == 0) {
            update(maxTake[0][sum / 2], maxTakeBit[here]);
        }
    }
    for (int bit = 1; bit < BITS; bit++) {
        solveBit(bit);
        for (int carry = -S; carry <= +S; carry++) {
            if (maxTake[bit - 1][carry] != -INF) {
                for (int here = -S; here <= +S; here++) {
                    int sum = carry + here - ((L >> bit) & 1);
                    if (maxTakeBit[here] != -INF && sum % 2 == 0) {
                        update(maxTake[bit][sum / 2], maxTake[bit - 1][carry] + maxTakeBit[here] * ((ll) 1 << bit));
                    }
                }
            }
        }
    }
    ll answer = maxTake[BITS - 1][0];
    if (answer != -INF) {
        cout << answer << "\n";
    } else {
        cout << "impossible\n";
    }

    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 151 ms 5204 KB Output is correct
6 Correct 134 ms 5204 KB Output is correct
7 Correct 67 ms 5204 KB Output is correct
8 Incorrect 136 ms 5220 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 151 ms 5204 KB Output is correct
6 Correct 134 ms 5204 KB Output is correct
7 Correct 67 ms 5204 KB Output is correct
8 Incorrect 136 ms 5220 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 52 ms 2088 KB Output is correct
3 Correct 15 ms 2116 KB Output is correct
4 Correct 42 ms 2004 KB Output is correct
5 Correct 44 ms 2004 KB Output is correct
6 Correct 11 ms 2004 KB Output is correct
7 Correct 18 ms 2004 KB Output is correct
8 Correct 6 ms 2004 KB Output is correct
9 Correct 7 ms 2112 KB Output is correct
10 Correct 37 ms 2096 KB Output is correct

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 52 ms 2088 KB Output is correct
3 Correct 15 ms 2116 KB Output is correct
4 Correct 42 ms 2004 KB Output is correct
5 Correct 44 ms 2004 KB Output is correct
6 Correct 11 ms 2004 KB Output is correct
7 Correct 18 ms 2004 KB Output is correct
8 Correct 6 ms 2004 KB Output is correct
9 Correct 7 ms 2112 KB Output is correct
10 Correct 37 ms 2096 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 40 ms 2004 KB Output is correct
16 Correct 15 ms 2004 KB Output is correct
17 Correct 33 ms 2004 KB Output is correct
18 Correct 44 ms 2004 KB Output is correct
19 Correct 12 ms 2004 KB Output is correct
20 Correct 10 ms 2004 KB Output is correct
21 Correct 6 ms 2004 KB Output is correct
22 Correct 8 ms 2004 KB Output is correct
23 Correct 23 ms 2004 KB Output is correct
24 Correct 119 ms 2108 KB Output is correct
25 Correct 27 ms 2004 KB Output is correct
26 Incorrect 97 ms 2096 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #4-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 52 ms 2088 KB Output is correct
3 Correct 15 ms 2116 KB Output is correct
4 Correct 42 ms 2004 KB Output is correct
5 Correct 44 ms 2004 KB Output is correct
6 Correct 11 ms 2004 KB Output is correct
7 Correct 18 ms 2004 KB Output is correct
8 Correct 6 ms 2004 KB Output is correct
9 Correct 7 ms 2112 KB Output is correct
10 Correct 37 ms 2096 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 37 ms 2092 KB Output is correct
13 Correct 16 ms 2120 KB Output is correct
14 Correct 42 ms 2096 KB Output is correct
15 Correct 46 ms 2092 KB Output is correct
16 Correct 12 ms 2004 KB Output is correct
17 Correct 10 ms 2004 KB Output is correct
18 Correct 7 ms 2004 KB Output is correct
19 Correct 8 ms 2004 KB Output is correct
20 Correct 20 ms 2116 KB Output is correct
21 Correct 4 ms 5204 KB Output is correct
22 Correct 7 ms 5220 KB Output is correct
23 Correct 216 ms 5204 KB Output is correct
24 Correct 175 ms 5208 KB Output is correct
25 Correct 240 ms 5204 KB Output is correct
26 Correct 308 ms 5324 KB Output is correct
27 Correct 223 ms 5140 KB Output is correct
28 Correct 184 ms 5204 KB Output is correct

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 151 ms 5204 KB Output is correct
6 Correct 134 ms 5204 KB Output is correct
7 Correct 67 ms 5204 KB Output is correct
8 Incorrect 136 ms 5220 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5-1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 52 ms 2088 KB Output is correct
3 Correct 15 ms 2116 KB Output is correct
4 Correct 42 ms 2004 KB Output is correct
5 Correct 44 ms 2004 KB Output is correct
6 Correct 11 ms 2004 KB Output is correct
7 Correct 18 ms 2004 KB Output is correct
8 Correct 6 ms 2004 KB Output is correct
9 Correct 7 ms 2112 KB Output is correct
10 Correct 37 ms 2096 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 37 ms 2092 KB Output is correct
13 Correct 16 ms 2120 KB Output is correct
14 Correct 42 ms 2096 KB Output is correct
15 Correct 46 ms 2092 KB Output is correct
16 Correct 12 ms 2004 KB Output is correct
17 Correct 10 ms 2004 KB Output is correct
18 Correct 7 ms 2004 KB Output is correct
19 Correct 8 ms 2004 KB Output is correct
20 Correct 20 ms 2116 KB Output is correct
21 Correct 4 ms 5204 KB Output is correct
22 Correct 7 ms 5220 KB Output is correct
23 Correct 216 ms 5204 KB Output is correct
24 Correct 175 ms 5208 KB Output is correct
25 Correct 240 ms 5204 KB Output is correct
26 Correct 308 ms 5324 KB Output is correct
27 Correct 223 ms 5140 KB Output is correct
28 Correct 184 ms 5204 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 35 ms 2004 KB Output is correct
31 Correct 15 ms 2116 KB Output is correct
32 Correct 35 ms 2004 KB Output is correct
33 Correct 40 ms 2004 KB Output is correct
34 Correct 11 ms 2116 KB Output is correct
35 Correct 9 ms 2004 KB Output is correct
36 Correct 8 ms 2004 KB Output is correct
37 Correct 7 ms 2004 KB Output is correct
38 Correct 20 ms 2004 KB Output is correct
39 Correct 5 ms 5220 KB Output is correct
40 Correct 6 ms 5204 KB Output is correct
41 Correct 219 ms 5324 KB Output is correct
42 Correct 165 ms 5204 KB Output is correct
43 Correct 246 ms 5204 KB Output is correct
44 Correct 306 ms 5204 KB Output is correct
45 Correct 215 ms 5204 KB Output is correct
46 Correct 193 ms 5204 KB Output is correct
47 Correct 24 ms 19668 KB Output is correct
48 Correct 31 ms 19692 KB Output is correct
49 Correct 3292 ms 19676 KB Output is correct
50 Correct 1610 ms 19680 KB Output is correct
51 Correct 4102 ms 19700 KB Output is correct
52 Correct 4094 ms 19676 KB Output is correct
53 Correct 3977 ms 19680 KB Output is correct
54 Correct 2257 ms 19672 KB Output is correct

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 151 ms 5204 KB Output is correct
6 Correct 134 ms 5204 KB Output is correct
7 Correct 67 ms 5204 KB Output is correct
8 Incorrect 136 ms 5220 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 52 ms 2088 KB Output is correct
3 Correct 15 ms 2116 KB Output is correct
4 Correct 42 ms 2004 KB Output is correct
5 Correct 44 ms 2004 KB Output is correct
6 Correct 11 ms 2004 KB Output is correct
7 Correct 18 ms 2004 KB Output is correct
8 Correct 6 ms 2004 KB Output is correct
9 Correct 7 ms 2112 KB Output is correct
10 Correct 37 ms 2096 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 37 ms 2092 KB Output is correct
13 Correct 16 ms 2120 KB Output is correct
14 Correct 42 ms 2096 KB Output is correct
15 Correct 46 ms 2092 KB Output is correct
16 Correct 12 ms 2004 KB Output is correct
17 Correct 10 ms 2004 KB Output is correct
18 Correct 7 ms 2004 KB Output is correct
19 Correct 8 ms 2004 KB Output is correct
20 Correct 20 ms 2116 KB Output is correct
21 Correct 4 ms 5204 KB Output is correct
22 Correct 7 ms 5220 KB Output is correct
23 Correct 216 ms 5204 KB Output is correct
24 Correct 175 ms 5208 KB Output is correct
25 Correct 240 ms 5204 KB Output is correct
26 Correct 308 ms 5324 KB Output is correct
27 Correct 223 ms 5140 KB Output is correct
28 Correct 184 ms 5204 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 35 ms 2004 KB Output is correct
31 Correct 15 ms 2116 KB Output is correct
32 Correct 35 ms 2004 KB Output is correct
33 Correct 40 ms 2004 KB Output is correct
34 Correct 11 ms 2116 KB Output is correct
35 Correct 9 ms 2004 KB Output is correct
36 Correct 8 ms 2004 KB Output is correct
37 Correct 7 ms 2004 KB Output is correct
38 Correct 20 ms 2004 KB Output is correct
39 Correct 5 ms 5220 KB Output is correct
40 Correct 6 ms 5204 KB Output is correct
41 Correct 219 ms 5324 KB Output is correct
42 Correct 165 ms 5204 KB Output is correct
43 Correct 246 ms 5204 KB Output is correct
44 Correct 306 ms 5204 KB Output is correct
45 Correct 215 ms 5204 KB Output is correct
46 Correct 193 ms 5204 KB Output is correct
47 Correct 24 ms 19668 KB Output is correct
48 Correct 31 ms 19692 KB Output is correct
49 Correct 3292 ms 19676 KB Output is correct
50 Correct 1610 ms 19680 KB Output is correct
51 Correct 4102 ms 19700 KB Output is correct
52 Correct 4094 ms 19676 KB Output is correct
53 Correct 3977 ms 19680 KB Output is correct
54 Correct 2257 ms 19672 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 35 ms 2004 KB Output is correct
57 Correct 15 ms 2004 KB Output is correct
58 Correct 32 ms 2004 KB Output is correct
59 Correct 42 ms 2096 KB Output is correct
60 Correct 16 ms 2004 KB Output is correct
61 Correct 9 ms 2004 KB Output is correct
62 Correct 6 ms 2004 KB Output is correct
63 Correct 6 ms 2004 KB Output is correct
64 Correct 19 ms 2004 KB Output is correct
65 Correct 5 ms 5204 KB Output is correct
66 Correct 6 ms 5204 KB Output is correct
67 Correct 208 ms 5204 KB Output is correct
68 Correct 169 ms 5204 KB Output is correct
69 Correct 238 ms 5204 KB Output is correct
70 Correct 305 ms 5208 KB Output is correct
71 Correct 212 ms 5204 KB Output is correct
72 Correct 186 ms 5204 KB Output is correct
73 Correct 24 ms 19704 KB Output is correct
74 Correct 30 ms 19668 KB Output is correct
75 Correct 3289 ms 19684 KB Output is correct
76 Correct 1588 ms 19688 KB Output is correct
77 Correct 4070 ms 19788 KB Output is correct
78 Correct 3869 ms 19676 KB Output is correct
79 Correct 3665 ms 19676 KB Output is correct
80 Correct 2236 ms 19680 KB Output is correct
81 Execution timed out 5077 ms 173028 KB Time limit exceeded
82 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 151 ms 5204 KB Output is correct
6 Correct 134 ms 5204 KB Output is correct
7 Correct 67 ms 5204 KB Output is correct
8 Incorrect 136 ms 5220 KB Output isn't correct
9 Halted 0 ms 0 KB -