oj.uz

답안 #544039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544039 2022-03-31T20:41:53 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>

using namespace std;

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

vector<int64_t> powr = {1};

bool submask (int64_t mask, int64_t cur) {
    return ((cur | mask) == mask);
}

bool process (SparseTable& st, int A, int B, int N, int64_t mask) {
    bitset<2000> dp[N + 1];
    bitset<2000> segments[N];
    for (int i = 0; i < N; i++) {
        for (int j = 1; j <= i; j++) {
            if (submask(mask, st.query(j, i))) {
                segments[i].set(j - 1);
            }
        }
    }
    for (int i = 0; i < N; i++) {
        if (submask(mask, st.query(0, i))) {
            dp[1].set(i);
        }
    }
    for (int j = 2; j <= N; j++) {
        for (int i = 0; i < N; i++) {
            if ((dp[j - 1] & segments[i]).count()) {
                dp[j].set(i);
            }
        }
    }
    for (int 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);
    int N, A, B;
    cin >> N >> A >> B;
    vector<int64_t> arr(N);
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    SparseTable st(arr);
    while (powr.size() != 60) {
        powr.push_back(powr.back() * 2);
    }
    const int MX = 58;
    int64_t cur = powr[MX + 1] - 1;
    for (int j = MX; j >= 0; j--) {
        if (process(st, A, B, N, cur - powr[j])) {
            cur -= powr[j];
        }
    }
    cout << cur;
}

Compilation message

sculpture.cpp: In constructor 'SparseTable::SparseTable(std::vector<long int>)':
sculpture.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for (int i = 0; i < arr.size(); i++) {
      |                         ~~^~~~~~~~~~~~
sculpture.cpp:39:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             for (int i = 0; i < arr.size(); i++) {
      |                             ~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 2 ms 328 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 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 4 ms 212 KB Output is correct
13 Correct 5 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 1 ms 212 KB Output is correct
17 Correct 1 ms 212 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 3 ms 212 KB Output is correct
22 Correct 3 ms 212 KB Output is correct
23 Correct 3 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 4 ms 212 KB Output is correct
26 Correct 3 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 212 KB Output is correct
30 Correct 3 ms 212 KB Output is correct
31 Correct 3 ms 332 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 5 ms 328 KB Output is correct
34 Correct 3 ms 212 KB Output is correct
35 Correct 5 ms 212 KB Output is correct
36 Correct 4 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 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 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 4 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 1 ms 212 KB Output is correct
17 Correct 1 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 3 ms 212 KB Output is correct
22 Correct 3 ms 212 KB Output is correct
23 Correct 3 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 3 ms 212 KB Output is correct
26 Correct 3 ms 212 KB Output is correct
27 Correct 3 ms 212 KB Output is correct
28 Correct 5 ms 328 KB Output is correct
29 Correct 10 ms 344 KB Output is correct
30 Correct 12 ms 356 KB Output is correct
31 Correct 17 ms 340 KB Output is correct
32 Correct 24 ms 348 KB Output is correct
33 Correct 26 ms 340 KB Output is correct
34 Correct 20 ms 356 KB Output is correct
35 Correct 19 ms 356 KB Output is correct
36 Correct 22 ms 352 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 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 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 3 ms 212 KB Output is correct
14 Correct 4 ms 212 KB Output is correct
15 Correct 6 ms 212 KB Output is correct
16 Correct 11 ms 340 KB Output is correct
17 Correct 14 ms 340 KB Output is correct
18 Correct 24 ms 356 KB Output is correct
19 Correct 20 ms 340 KB Output is correct
20 Correct 19 ms 348 KB Output is correct
21 Correct 18 ms 348 KB Output is correct
22 Correct 18 ms 352 KB Output is correct
23 Correct 18 ms 352 KB Output is correct
24 Correct 19 ms 340 KB Output is correct
25 Correct 31 ms 340 KB Output is correct
26 Correct 44 ms 340 KB Output is correct
27 Correct 60 ms 360 KB Output is correct
28 Correct 73 ms 340 KB Output is correct
29 Correct 75 ms 376 KB Output is correct
30 Correct 81 ms 340 KB Output is correct
31 Correct 75 ms 340 KB Output is correct
32 Correct 73 ms 340 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 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 284 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 4 ms 332 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 5 ms 212 KB Output is correct
13 Correct 4 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 1 ms 212 KB Output is correct
17 Correct 1 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 3 ms 212 KB Output is correct
22 Correct 3 ms 212 KB Output is correct
23 Correct 3 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 3 ms 212 KB Output is correct
26 Correct 3 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 212 KB Output is correct
30 Correct 3 ms 212 KB Output is correct
31 Correct 3 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 3 ms 212 KB Output is correct
34 Correct 4 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 3 ms 212 KB Output is correct
37 Correct 4 ms 212 KB Output is correct
38 Correct 5 ms 212 KB Output is correct
39 Correct 14 ms 340 KB Output is correct
40 Correct 13 ms 344 KB Output is correct
41 Correct 18 ms 356 KB Output is correct
42 Correct 19 ms 352 KB Output is correct
43 Correct 18 ms 352 KB Output is correct
44 Correct 19 ms 340 KB Output is correct
45 Correct 24 ms 352 KB Output is correct
46 Correct 21 ms 352 KB Output is correct
47 Correct 25 ms 340 KB Output is correct
48 Correct 31 ms 340 KB Output is correct
49 Correct 46 ms 364 KB Output is correct
50 Correct 62 ms 340 KB Output is correct
51 Correct 80 ms 372 KB Output is correct
52 Correct 76 ms 372 KB Output is correct
53 Correct 77 ms 372 KB Output is correct
54 Correct 82 ms 372 KB Output is correct
55 Correct 78 ms 308 KB Output is correct
56 Correct 21 ms 356 KB Output is correct
57 Correct 47 ms 340 KB Output is correct
58 Correct 61 ms 368 KB Output is correct
59 Correct 85 ms 340 KB Output is correct
60 Correct 74 ms 340 KB Output is correct
61 Correct 83 ms 368 KB Output is correct
62 Correct 82 ms 372 KB Output is correct
63 Correct 81 ms 376 KB Output is correct
64 Correct 61 ms 364 KB Output is correct
65 Correct 18 ms 356 KB Output is correct
66 Correct 35 ms 344 KB Output is correct
67 Correct 47 ms 352 KB Output is correct
68 Correct 61 ms 360 KB Output is correct
69 Correct 75 ms 340 KB Output is correct
70 Correct 75 ms 372 KB Output is correct
71 Correct 93 ms 372 KB Output is correct
72 Correct 78 ms 376 KB Output is correct
73 Correct 86 ms 372 KB Output is correct
74 Correct 75 ms 376 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 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 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 3 ms 328 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 4 ms 212 KB Output is correct
11 Correct 6 ms 212 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 3 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 2 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 3 ms 212 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 3 ms 212 KB Output is correct
23 Correct 3 ms 324 KB Output is correct
24 Correct 4 ms 212 KB Output is correct
25 Correct 5 ms 336 KB Output is correct
26 Correct 11 ms 340 KB Output is correct
27 Correct 13 ms 340 KB Output is correct
28 Correct 18 ms 352 KB Output is correct
29 Correct 20 ms 356 KB Output is correct
30 Correct 18 ms 340 KB Output is correct
31 Correct 20 ms 340 KB Output is correct
32 Correct 18 ms 356 KB Output is correct
33 Correct 22 ms 340 KB Output is correct
34 Correct 23 ms 356 KB Output is correct
35 Correct 37 ms 340 KB Output is correct
36 Correct 48 ms 340 KB Output is correct
37 Correct 79 ms 340 KB Output is correct
38 Correct 75 ms 376 KB Output is correct
39 Correct 78 ms 372 KB Output is correct
40 Correct 82 ms 460 KB Output is correct
41 Correct 76 ms 340 KB Output is correct
42 Correct 74 ms 340 KB Output is correct
43 Correct 20 ms 348 KB Output is correct
44 Correct 50 ms 356 KB Output is correct
45 Correct 62 ms 340 KB Output is correct
46 Correct 75 ms 372 KB Output is correct
47 Correct 79 ms 376 KB Output is correct
48 Correct 76 ms 376 KB Output is correct
49 Correct 85 ms 372 KB Output is correct
50 Correct 77 ms 388 KB Output is correct
51 Correct 77 ms 340 KB Output is correct
52 Execution timed out 1083 ms 724 KB Time limit exceeded
53 Halted 0 ms 0 KB -