oj.uz

답안 #753240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
753240 2023-06-04T22:33:34 Z Olympia K개의 묶음 (IZhO14_blocks) C++17
53 / 100
 1000 ms 45388 KB 
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <map>
#include <set>
using namespace std;
vector<int64_t> p;
struct SegmentTree {
    int64_t orig[262144];
    int64_t vec[262144];
    int64_t lazy[262144];
    const int64_t INF = 1e18;
    void push (int dum) {
        if (lazy[dum] == -1) {
            return;
        }
        lazy[2 * dum + 1] = lazy[dum];
        lazy[2 * dum + 2] = lazy[dum];
        vec[2 * dum + 1] = lazy[dum] + orig[2 * dum + 1];
        vec[2 * dum + 2] = lazy[dum] + orig[2 * dum + 2];
        lazy[dum] = -1;
    }
    void upd (int dum, int tl, int tr, int l, int r, int64_t x) {
        if (tl >= l and tr <= r) {
            lazy[dum] = x;
            vec[dum] = orig[dum] + x;
            return;
        }
        if (tl > r or l > tr) {
            return;
        }
        push(dum);
        upd(2 * dum + 1, tl, (tl + tr)/2, l, r, x);
        upd(2 * dum + 2, (tl + tr)/2 + 1, tr, l, r, x);
        vec[dum] = min(vec[2 * dum + 1], vec[2 * dum + 2]);
    }
    int64_t query (int dum, int tl, int tr, int l, int r) {
        if (tl >= l and tr <= r) {
            return vec[dum];
        }
        if (tl > r or l > tr) {
            return INF;
        }
        push(dum);
        return min(query(2 * dum + 1, tl, (tl + tr)/2, l, r), query(2 * dum + 2, (tl + tr)/2 + 1, tr, l, r));
    }
    void upd (int l, int r, int64_t x) {
        upd(0, 0, (int)p.size() - 1, l, r, x);
    }
    int64_t query (int l, int r) {
        return query(0, 0, (int)p.size() - 1, l, r);
    }
    void build (int dum, int tl, int tr) {
        if (tl == tr) {
            orig[dum] = p[tl];
            return;
        }
        build(2 * dum + 1, tl, (tl + tr)/2);
        build(2 * dum + 2, (tl + tr)/2 + 1, tr);
        orig[dum] = min(orig[2 * dum + 1], orig[2 * dum + 2]);
    }
    void reset () {
        for (int i = 0; i < 2 * p.size(); i++) {
            orig[i] = 0, lazy[i] = -1;
        }
        build(0, 0, (int)p.size() - 1);
        for (int i = 0; i < 2 * p.size(); i++) {
            vec[i] = orig[i];
        }
    }
    SegmentTree () {
        int n = p.size();
        for (int i = 0; i < 2 * n; i++) {
            orig[i] = 0;
            lazy[i] = -1;
        }
        build(0, 0, n - 1);
        for (int i = 0; i < 2 * n; i++) {
            vec[i] = orig[i];
        }
    }
};
struct SparseTable {
    int64_t dp[131072][18];
    int64_t query (int l, int r) {
        int sz = log2(r - l + 1);
        return min(dp[l][sz], dp[r - (1 << sz) + 1][sz]);
    }
    void upd (vector<int64_t> &a) {
        int n = a.size();
        for (int j = 0; j < 18; j++) {
            for (int i = 0; i < n; i++) {
                if (j == 0) {
                    dp[i][j] = a[i];
                } else {
                    dp[i][j] = min(dp[i][j - 1], dp[min(i + (1 << (j - 1)), 131071)][j - 1]);
                }
            }
        }
    }
};
int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, K;
    cin >> N >> K;
    vector<int64_t> arr(N);
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }
    int64_t INF = 1e17;
    vector<int64_t> cur(N + 1);
    p.assign(N + 1, INF), cur.assign(N + 1, INF);
    for (int j = 1; j <= N; j++) {
        p[j] = ((j == 1) ? arr[0] : max(p[j - 1], arr[j - 1]));
    }
    for (int i = 0; i < arr.size(); i++) {
        arr[i] = -arr[i];
    }
    SparseTable st_a;
    st_a.upd(arr);
    for (int i = 0; i < arr.size(); i++) {
        arr[i] = -arr[i];
    }
    int nxt[N];
    for (int j = 0; j < N; j++) {
        int l = 0;
        int r = j;
        while (l != r) {
            int m = (l + r)/2;
            if (st_a.query(m, j) == -arr[j]) {
                r = m;
            } else {
                l = m + 1;
            }
        }
        nxt[j] = l;
    }
    while (__builtin_popcount(p.size()) != 1) {
        p.push_back(0);
        cur.push_back(0);
    }
    SparseTable st_p;
    SegmentTree val;
    for (int i = 2; i <= K; i++) {
        val.reset();
        st_p.upd(p);
        for (int j = 1; j <= N; j++) {
            if (j == 1) {
                cur[j] = p[0] + arr[0];
            } else {
                cur[j] = INF;
                int ind = nxt[j - 1];
                val.upd(ind, j - 1, arr[j - 1]);
                cur[j] = min(val.query(0, ind - 1), arr[j - 1] + st_p.query(ind, j - 1));
            }
        }
        swap(cur, p);
    }
    cout << p[N];

}

Compilation message

blocks.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("O3")
      | 
blocks.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization ("unroll-loops")
      | 
blocks.cpp: In member function 'void SegmentTree::reset()':
blocks.cpp:67:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for (int i = 0; i < 2 * p.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~
blocks.cpp:71:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         for (int i = 0; i < 2 * p.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~
blocks.cpp: In function 'int main()':
blocks.cpp:121:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |     for (int i = 0; i < arr.size(); i++) {
      |                     ~~^~~~~~~~~~~~
blocks.cpp:126:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |     for (int i = 0; i < arr.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 43348 KB Output is correct
2 Correct 21 ms 43348 KB Output is correct
3 Correct 20 ms 43344 KB Output is correct
4 Correct 20 ms 43380 KB Output is correct
5 Correct 20 ms 43292 KB Output is correct
6 Correct 19 ms 43284 KB Output is correct
7 Correct 19 ms 43348 KB Output is correct
8 Correct 19 ms 43328 KB Output is correct
9 Correct 20 ms 43368 KB Output is correct
10 Correct 18 ms 43408 KB Output is correct
11 Correct 19 ms 43296 KB Output is correct
12 Correct 21 ms 43348 KB Output is correct
13 Correct 21 ms 43316 KB Output is correct
14 Correct 22 ms 43348 KB Output is correct
15 Correct 21 ms 43340 KB Output is correct
16 Correct 20 ms 43348 KB Output is correct
17 Correct 19 ms 43348 KB Output is correct
18 Correct 19 ms 43352 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 43392 KB Output is correct
2 Correct 20 ms 43340 KB Output is correct
3 Correct 20 ms 43348 KB Output is correct
4 Correct 20 ms 43380 KB Output is correct
5 Correct 19 ms 43280 KB Output is correct
6 Correct 20 ms 43348 KB Output is correct
7 Correct 19 ms 43412 KB Output is correct
8 Correct 19 ms 43376 KB Output is correct
9 Correct 21 ms 43308 KB Output is correct
10 Correct 19 ms 43304 KB Output is correct
11 Correct 20 ms 43336 KB Output is correct
12 Correct 20 ms 43384 KB Output is correct
13 Correct 20 ms 43348 KB Output is correct
14 Correct 20 ms 43348 KB Output is correct
15 Correct 18 ms 43376 KB Output is correct
16 Correct 19 ms 43340 KB Output is correct
17 Correct 21 ms 43348 KB Output is correct
18 Correct 19 ms 43340 KB Output is correct
19 Correct 20 ms 43336 KB Output is correct
20 Correct 20 ms 43340 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 43348 KB Output is correct
2 Correct 21 ms 43348 KB Output is correct
3 Correct 20 ms 43344 KB Output is correct
4 Correct 20 ms 43380 KB Output is correct
5 Correct 20 ms 43292 KB Output is correct
6 Correct 19 ms 43284 KB Output is correct
7 Correct 19 ms 43348 KB Output is correct
8 Correct 19 ms 43328 KB Output is correct
9 Correct 20 ms 43368 KB Output is correct
10 Correct 18 ms 43408 KB Output is correct
11 Correct 19 ms 43296 KB Output is correct
12 Correct 21 ms 43348 KB Output is correct
13 Correct 21 ms 43316 KB Output is correct
14 Correct 22 ms 43348 KB Output is correct
15 Correct 21 ms 43340 KB Output is correct
16 Correct 20 ms 43348 KB Output is correct
17 Correct 19 ms 43348 KB Output is correct
18 Correct 19 ms 43352 KB Output is correct
19 Correct 19 ms 43392 KB Output is correct
20 Correct 20 ms 43340 KB Output is correct
21 Correct 20 ms 43348 KB Output is correct
22 Correct 20 ms 43380 KB Output is correct
23 Correct 19 ms 43280 KB Output is correct
24 Correct 20 ms 43348 KB Output is correct
25 Correct 19 ms 43412 KB Output is correct
26 Correct 19 ms 43376 KB Output is correct
27 Correct 21 ms 43308 KB Output is correct
28 Correct 19 ms 43304 KB Output is correct
29 Correct 20 ms 43336 KB Output is correct
30 Correct 20 ms 43384 KB Output is correct
31 Correct 20 ms 43348 KB Output is correct
32 Correct 20 ms 43348 KB Output is correct
33 Correct 18 ms 43376 KB Output is correct
34 Correct 19 ms 43340 KB Output is correct
35 Correct 21 ms 43348 KB Output is correct
36 Correct 19 ms 43340 KB Output is correct
37 Correct 20 ms 43336 KB Output is correct
38 Correct 20 ms 43340 KB Output is correct
39 Correct 23 ms 43348 KB Output is correct
40 Correct 19 ms 43348 KB Output is correct
41 Correct 19 ms 43384 KB Output is correct
42 Correct 21 ms 43340 KB Output is correct
43 Correct 19 ms 43312 KB Output is correct
44 Correct 19 ms 43348 KB Output is correct
45 Correct 21 ms 43332 KB Output is correct
46 Correct 19 ms 43348 KB Output is correct
47 Correct 19 ms 43312 KB Output is correct
48 Correct 20 ms 43460 KB Output is correct
49 Correct 20 ms 43348 KB Output is correct
50 Correct 22 ms 43384 KB Output is correct
51 Correct 20 ms 43368 KB Output is correct
52 Correct 21 ms 43312 KB Output is correct
53 Correct 21 ms 43404 KB Output is correct
54 Correct 20 ms 43292 KB Output is correct
55 Correct 21 ms 43380 KB Output is correct
56 Correct 20 ms 43348 KB Output is correct
57 Correct 26 ms 43400 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 43348 KB Output is correct
2 Correct 21 ms 43348 KB Output is correct
3 Correct 20 ms 43344 KB Output is correct
4 Correct 20 ms 43380 KB Output is correct
5 Correct 20 ms 43292 KB Output is correct
6 Correct 19 ms 43284 KB Output is correct
7 Correct 19 ms 43348 KB Output is correct
8 Correct 19 ms 43328 KB Output is correct
9 Correct 20 ms 43368 KB Output is correct
10 Correct 18 ms 43408 KB Output is correct
11 Correct 19 ms 43296 KB Output is correct
12 Correct 21 ms 43348 KB Output is correct
13 Correct 21 ms 43316 KB Output is correct
14 Correct 22 ms 43348 KB Output is correct
15 Correct 21 ms 43340 KB Output is correct
16 Correct 20 ms 43348 KB Output is correct
17 Correct 19 ms 43348 KB Output is correct
18 Correct 19 ms 43352 KB Output is correct
19 Correct 19 ms 43392 KB Output is correct
20 Correct 20 ms 43340 KB Output is correct
21 Correct 20 ms 43348 KB Output is correct
22 Correct 20 ms 43380 KB Output is correct
23 Correct 19 ms 43280 KB Output is correct
24 Correct 20 ms 43348 KB Output is correct
25 Correct 19 ms 43412 KB Output is correct
26 Correct 19 ms 43376 KB Output is correct
27 Correct 21 ms 43308 KB Output is correct
28 Correct 19 ms 43304 KB Output is correct
29 Correct 20 ms 43336 KB Output is correct
30 Correct 20 ms 43384 KB Output is correct
31 Correct 20 ms 43348 KB Output is correct
32 Correct 20 ms 43348 KB Output is correct
33 Correct 18 ms 43376 KB Output is correct
34 Correct 19 ms 43340 KB Output is correct
35 Correct 21 ms 43348 KB Output is correct
36 Correct 19 ms 43340 KB Output is correct
37 Correct 20 ms 43336 KB Output is correct
38 Correct 20 ms 43340 KB Output is correct
39 Correct 23 ms 43348 KB Output is correct
40 Correct 19 ms 43348 KB Output is correct
41 Correct 19 ms 43384 KB Output is correct
42 Correct 21 ms 43340 KB Output is correct
43 Correct 19 ms 43312 KB Output is correct
44 Correct 19 ms 43348 KB Output is correct
45 Correct 21 ms 43332 KB Output is correct
46 Correct 19 ms 43348 KB Output is correct
47 Correct 19 ms 43312 KB Output is correct
48 Correct 20 ms 43460 KB Output is correct
49 Correct 20 ms 43348 KB Output is correct
50 Correct 22 ms 43384 KB Output is correct
51 Correct 20 ms 43368 KB Output is correct
52 Correct 21 ms 43312 KB Output is correct
53 Correct 21 ms 43404 KB Output is correct
54 Correct 20 ms 43292 KB Output is correct
55 Correct 21 ms 43380 KB Output is correct
56 Correct 20 ms 43348 KB Output is correct
57 Correct 26 ms 43400 KB Output is correct
58 Correct 115 ms 43912 KB Output is correct
59 Correct 42 ms 45228 KB Output is correct
60 Correct 202 ms 45388 KB Output is correct
61 Execution timed out 1100 ms 45216 KB Time limit exceeded
62 Halted 0 ms 0 KB -