oj.uz

답안 #544043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544043 2022-03-31T20:48:58 Z Olympia Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 596 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<int64_t> pref;
    vector<int64_t> arr;
public:
    int64_t query (int l, int r) {
        return pref[r + 1] - pref[l];
    }
    SparseTable (vector<int64_t> arr) {
        this->arr = arr;
        pref = {0};
        for (int i = 1; i <= arr.size(); i++) {
            pref.push_back(pref.back() + arr[i - 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 = i; j >= 1; 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:30:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for (int i = 1; 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 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 3 ms 212 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 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 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 3 ms 212 KB Output is correct
26 Correct 3 ms 320 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 2 ms 224 KB Output is correct
30 Correct 3 ms 328 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 3 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 3 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 3 ms 212 KB Output is correct
7 Correct 3 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 4 ms 212 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 320 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 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 3 ms 212 KB Output is correct
21 Correct 4 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 320 KB Output is correct
25 Correct 4 ms 212 KB Output is correct
26 Correct 3 ms 212 KB Output is correct
27 Correct 3 ms 320 KB Output is correct
28 Correct 4 ms 224 KB Output is correct
29 Correct 9 ms 336 KB Output is correct
30 Correct 11 ms 332 KB Output is correct
31 Correct 16 ms 348 KB Output is correct
32 Correct 15 ms 340 KB Output is correct
33 Correct 17 ms 340 KB Output is correct
34 Correct 16 ms 212 KB Output is correct
35 Correct 17 ms 340 KB Output is correct
36 Correct 16 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 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 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 6 ms 324 KB Output is correct
13 Correct 3 ms 212 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 5 ms 212 KB Output is correct
16 Correct 10 ms 328 KB Output is correct
17 Correct 11 ms 212 KB Output is correct
18 Correct 15 ms 340 KB Output is correct
19 Correct 15 ms 344 KB Output is correct
20 Correct 15 ms 340 KB Output is correct
21 Correct 15 ms 336 KB Output is correct
22 Correct 17 ms 340 KB Output is correct
23 Correct 17 ms 212 KB Output is correct
24 Correct 17 ms 340 KB Output is correct
25 Correct 25 ms 340 KB Output is correct
26 Correct 49 ms 340 KB Output is correct
27 Correct 54 ms 340 KB Output is correct
28 Correct 61 ms 348 KB Output is correct
29 Correct 62 ms 344 KB Output is correct
30 Correct 60 ms 344 KB Output is correct
31 Correct 64 ms 340 KB Output is correct
32 Correct 73 ms 348 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 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 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 324 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 3 ms 320 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 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 4 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 2 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 320 KB Output is correct
33 Correct 3 ms 212 KB Output is correct
34 Correct 3 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 3 ms 212 KB Output is correct
38 Correct 6 ms 212 KB Output is correct
39 Correct 9 ms 212 KB Output is correct
40 Correct 11 ms 336 KB Output is correct
41 Correct 15 ms 344 KB Output is correct
42 Correct 15 ms 340 KB Output is correct
43 Correct 15 ms 340 KB Output is correct
44 Correct 16 ms 340 KB Output is correct
45 Correct 17 ms 212 KB Output is correct
46 Correct 15 ms 344 KB Output is correct
47 Correct 20 ms 340 KB Output is correct
48 Correct 39 ms 340 KB Output is correct
49 Correct 42 ms 340 KB Output is correct
50 Correct 52 ms 340 KB Output is correct
51 Correct 61 ms 340 KB Output is correct
52 Correct 60 ms 344 KB Output is correct
53 Correct 66 ms 360 KB Output is correct
54 Correct 66 ms 348 KB Output is correct
55 Correct 64 ms 344 KB Output is correct
56 Correct 17 ms 340 KB Output is correct
57 Correct 38 ms 352 KB Output is correct
58 Correct 49 ms 340 KB Output is correct
59 Correct 62 ms 460 KB Output is correct
60 Correct 71 ms 344 KB Output is correct
61 Correct 68 ms 344 KB Output is correct
62 Correct 64 ms 344 KB Output is correct
63 Correct 59 ms 340 KB Output is correct
64 Correct 49 ms 340 KB Output is correct
65 Correct 15 ms 340 KB Output is correct
66 Correct 26 ms 348 KB Output is correct
67 Correct 37 ms 340 KB Output is correct
68 Correct 50 ms 344 KB Output is correct
69 Correct 60 ms 340 KB Output is correct
70 Correct 61 ms 340 KB Output is correct
71 Correct 68 ms 344 KB Output is correct
72 Correct 66 ms 340 KB Output is correct
73 Correct 64 ms 348 KB Output is correct
74 Correct 63 ms 360 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 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 324 KB Output is correct
10 Correct 3 ms 212 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 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 340 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 212 KB Output is correct
22 Correct 3 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 4 ms 212 KB Output is correct
26 Correct 9 ms 340 KB Output is correct
27 Correct 10 ms 340 KB Output is correct
28 Correct 16 ms 348 KB Output is correct
29 Correct 22 ms 344 KB Output is correct
30 Correct 21 ms 336 KB Output is correct
31 Correct 16 ms 340 KB Output is correct
32 Correct 16 ms 340 KB Output is correct
33 Correct 16 ms 340 KB Output is correct
34 Correct 15 ms 344 KB Output is correct
35 Correct 27 ms 340 KB Output is correct
36 Correct 36 ms 340 KB Output is correct
37 Correct 49 ms 340 KB Output is correct
38 Correct 63 ms 340 KB Output is correct
39 Correct 67 ms 340 KB Output is correct
40 Correct 66 ms 340 KB Output is correct
41 Correct 67 ms 348 KB Output is correct
42 Correct 65 ms 348 KB Output is correct
43 Correct 19 ms 340 KB Output is correct
44 Correct 40 ms 344 KB Output is correct
45 Correct 62 ms 340 KB Output is correct
46 Correct 63 ms 348 KB Output is correct
47 Correct 61 ms 340 KB Output is correct
48 Correct 62 ms 352 KB Output is correct
49 Correct 65 ms 340 KB Output is correct
50 Correct 70 ms 340 KB Output is correct
51 Correct 62 ms 360 KB Output is correct
52 Execution timed out 1076 ms 596 KB Time limit exceeded
53 Halted 0 ms 0 KB -