oj.uz

Submission #544037

# Submission time Handle Problem Language Result Execution time Memory
544037 2022-03-31T20:38:03 Z Olympia Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 724 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <bitset>
#include <stack>
#include <cstdlib>
#include <queue>
#include <stdint.h>
#include <cstdio>
#include <limits.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O1")
#pragma GCC optimization ("unroll-loops")

using namespace std;

class SparseTable {
    vector<vector<int64_t>> dp;
    vector<int64_t> arr;
public:
    int64_t query (int64_t l, int64_t r) {
        if (l == r) {
            return arr[l];
        }
        int64_t sz = log2(r - l);
        return dp[l][sz] + query(l + (1 << sz), r);
    }
    SparseTable (vector<int64_t> arr) {
        this->arr = arr;
        dp.resize(arr.size());
        for (int64_t i = 0; i < arr.size(); i++) {
            dp[i].resize(32);
            dp[i][0] = arr[i];
        }
        for (int64_t j = 1; j < 32; j++) {
            for (int64_t i = 0; i < arr.size(); i++) {
                dp[i][j] = dp[i][j - 1] + dp[min(i + (1 << (j - 1)), (int64_t)arr.size() - 1)][j - 1];
            }
        }
    }
};

vector<int64_t> powr = {1};

bool submask (int64_t mask, int64_t cur) {
    //cout << mask << " " << cur << " " << (cur | mask) << '\n';
    return ((cur | mask) == mask);
}

bool process (SparseTable& st, int64_t A, int64_t B, int64_t N, int64_t mask) {
    bitset<2000> dp[N + 1];
    bitset<2000> segments[N];
    for (int64_t i = 0; i < N; i++) {
        for (int64_t j = 1; j <= i; j++) {
            if (submask(mask, st.query(j, i))) {
                segments[i].set(j - 1);
            }
        }
    }
    for (int64_t i = 0; i < N; i++) {
        if (submask(mask, st.query(0, i))) {
            dp[1].set(i);
        }
    }
    for (int64_t j = 2; j <= N; j++) {
        for (int64_t i = 0; i < N; i++) {
            if ((dp[j - 1] & segments[i]).count()) {
                dp[j].set(i);
            }
        }
    }
    for (int64_t j = A; j <= B; j++) {
        if (dp[j][N - 1]) {
            return true;
        }
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int64_t N, A, B;
    cin >> N >> A >> B;
    vector<int64_t> arr(N);
    for (int64_t i = 0; i < N; i++) {
        cin >> arr[i];
    }
    SparseTable st(arr);
    while (powr.size() != 60) {
        powr.push_back(powr.back() * 2);
    }
    const int64_t MX = 58;
    int64_t cur = powr[MX + 1] - 1;
    for (int64_t j = MX; j >= 0; j--) {
        if (process(st, A, B, N, cur - powr[j])) {
            cur -= powr[j];
        }
    }
    cout << cur;
}

Compilation message

sculpture.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   18 | #pragma GCC optimization ("O1")
      | 
sculpture.cpp:19: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   19 | #pragma GCC optimization ("unroll-loops")
      | 
sculpture.cpp: In constructor 'SparseTable::SparseTable(std::vector<long int>)':
sculpture.cpp:37:31: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for (int64_t i = 0; i < arr.size(); i++) {
      |                             ~~^~~~~~~~~~~~
sculpture.cpp:42:35: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |             for (int64_t i = 0; i < arr.size(); i++) {
      |                                 ~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 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 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 2 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 2 ms 212 KB Output is correct
31 Correct 2 ms 320 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 2 ms 324 KB Output is correct
34 Correct 2 ms 212 KB Output is correct
35 Correct 2 ms 320 KB Output is correct
36 Correct 2 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 2 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 2 ms 212 KB Output is correct
28 Correct 3 ms 212 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 8 ms 348 KB Output is correct
31 Correct 11 ms 352 KB Output is correct
32 Correct 10 ms 356 KB Output is correct
33 Correct 11 ms 340 KB Output is correct
34 Correct 10 ms 348 KB Output is correct
35 Correct 11 ms 352 KB Output is correct
36 Correct 10 ms 356 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 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 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 3 ms 252 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 8 ms 340 KB Output is correct
18 Correct 11 ms 352 KB Output is correct
19 Correct 10 ms 340 KB Output is correct
20 Correct 11 ms 340 KB Output is correct
21 Correct 12 ms 340 KB Output is correct
22 Correct 11 ms 356 KB Output is correct
23 Correct 11 ms 356 KB Output is correct
24 Correct 14 ms 348 KB Output is correct
25 Correct 19 ms 360 KB Output is correct
26 Correct 26 ms 340 KB Output is correct
27 Correct 39 ms 340 KB Output is correct
28 Correct 47 ms 380 KB Output is correct
29 Correct 45 ms 340 KB Output is correct
30 Correct 45 ms 340 KB Output is correct
31 Correct 46 ms 340 KB Output is correct
32 Correct 48 ms 384 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 1 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 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 212 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 2 ms 212 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 2 ms 212 KB Output is correct
37 Correct 2 ms 212 KB Output is correct
38 Correct 3 ms 340 KB Output is correct
39 Correct 7 ms 340 KB Output is correct
40 Correct 8 ms 360 KB Output is correct
41 Correct 12 ms 340 KB Output is correct
42 Correct 12 ms 320 KB Output is correct
43 Correct 12 ms 360 KB Output is correct
44 Correct 11 ms 356 KB Output is correct
45 Correct 11 ms 340 KB Output is correct
46 Correct 12 ms 356 KB Output is correct
47 Correct 11 ms 340 KB Output is correct
48 Correct 19 ms 368 KB Output is correct
49 Correct 27 ms 340 KB Output is correct
50 Correct 39 ms 372 KB Output is correct
51 Correct 49 ms 384 KB Output is correct
52 Correct 48 ms 376 KB Output is correct
53 Correct 52 ms 376 KB Output is correct
54 Correct 45 ms 376 KB Output is correct
55 Correct 45 ms 320 KB Output is correct
56 Correct 13 ms 340 KB Output is correct
57 Correct 28 ms 320 KB Output is correct
58 Correct 40 ms 372 KB Output is correct
59 Correct 46 ms 380 KB Output is correct
60 Correct 46 ms 376 KB Output is correct
61 Correct 46 ms 340 KB Output is correct
62 Correct 48 ms 376 KB Output is correct
63 Correct 47 ms 340 KB Output is correct
64 Correct 37 ms 320 KB Output is correct
65 Correct 13 ms 356 KB Output is correct
66 Correct 19 ms 364 KB Output is correct
67 Correct 27 ms 340 KB Output is correct
68 Correct 38 ms 340 KB Output is correct
69 Correct 45 ms 340 KB Output is correct
70 Correct 47 ms 380 KB Output is correct
71 Correct 48 ms 340 KB Output is correct
72 Correct 47 ms 340 KB Output is correct
73 Correct 45 ms 340 KB Output is correct
74 Correct 45 ms 340 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 2 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 1 ms 212 KB Output is correct
17 Correct 2 ms 320 KB Output is correct
18 Correct 2 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 2 ms 316 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 6 ms 324 KB Output is correct
27 Correct 7 ms 340 KB Output is correct
28 Correct 11 ms 352 KB Output is correct
29 Correct 11 ms 340 KB Output is correct
30 Correct 11 ms 356 KB Output is correct
31 Correct 17 ms 316 KB Output is correct
32 Correct 11 ms 340 KB Output is correct
33 Correct 10 ms 356 KB Output is correct
34 Correct 13 ms 356 KB Output is correct
35 Correct 18 ms 368 KB Output is correct
36 Correct 26 ms 340 KB Output is correct
37 Correct 38 ms 340 KB Output is correct
38 Correct 48 ms 376 KB Output is correct
39 Correct 45 ms 376 KB Output is correct
40 Correct 45 ms 340 KB Output is correct
41 Correct 45 ms 340 KB Output is correct
42 Correct 48 ms 388 KB Output is correct
43 Correct 11 ms 320 KB Output is correct
44 Correct 27 ms 320 KB Output is correct
45 Correct 41 ms 368 KB Output is correct
46 Correct 48 ms 380 KB Output is correct
47 Correct 50 ms 392 KB Output is correct
48 Correct 48 ms 340 KB Output is correct
49 Correct 49 ms 340 KB Output is correct
50 Correct 49 ms 392 KB Output is correct
51 Correct 50 ms 388 KB Output is correct
52 Execution timed out 1093 ms 724 KB Time limit exceeded
53 Halted 0 ms 0 KB -