oj.uz

답안 #1034625

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034625 2024-07-25T15:30:17 Z TrinhKhanhDung K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 126 ms 44856 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int N = 1e5 + 10, K = 1e2 + 10;

int n, k;
int a[N];

void input(){
    cin >> n >> k;
    for(int i=1; i<=n; i++){
        cin >> a[i];
    }
}

namespace subtask3{
    ll f[K][K];

    void solve(){
        memset(f, 0x3f, sizeof f);
        f[0][0] = 0;
        for(int i=0; i<k; i++) for(int j=0; j<n; j++) if(f[i][j] < oo){
            int ma = 0;
            for(int p=j+1; p<=n; p++){
                maximize(ma, a[p]);
                minimize(f[i + 1][p], f[i][j] + ma);
            }
        }

        cout << f[k][n] << '\n';
    }
}

namespace subtask4{
    int f[K][N];

    void solve(){
        memset(f, 0x3f, sizeof f);
        f[1][1] = a[1];
        for(int i=2; i<=n; i++){
            f[1][i] = max(f[1][i - 1], a[i]);
//            cout << f[1][i] <<  ' ';
        }
//        cout << '\n';

        a[0] = INF;
        for(int i=2; i<=k; i++){
            stack<pair<int, int>> st;

            for(int j=1; j<=n; j++){
                int num = f[i - 1][j - 1];
                while(!st.empty() && a[st.top().fi] <= a[j]){
                    minimize(num, st.top().se);
                    st.pop();
                }
                if(st.empty() || a[j] + num < a[st.top().fi] + st.top().se) st.push(make_pair(j, num));
                if(j >= i){
                    f[i][j] = a[st.top().fi] + st.top().se;
                }
//                cout << f[i][j] << ' ';
            }
//            cout << '\n';
        }

        cout << f[k][n] << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
   // freopen("task.inp", "r", stdin);
   // freopen("task.out", "w", stdout);

    input();
    return subtask4::solve(), 0;

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 43352 KB Output is correct
2 Correct 17 ms 43356 KB Output is correct
3 Correct 18 ms 43312 KB Output is correct
4 Correct 18 ms 43292 KB Output is correct
5 Correct 17 ms 43356 KB Output is correct
6 Correct 17 ms 43356 KB Output is correct
7 Correct 20 ms 43356 KB Output is correct
8 Correct 17 ms 43352 KB Output is correct
9 Correct 22 ms 43612 KB Output is correct
10 Correct 18 ms 43356 KB Output is correct
11 Correct 18 ms 43352 KB Output is correct
12 Correct 17 ms 43356 KB Output is correct
13 Correct 17 ms 43356 KB Output is correct
14 Correct 16 ms 43356 KB Output is correct
15 Correct 16 ms 43416 KB Output is correct
16 Correct 17 ms 43352 KB Output is correct
17 Correct 16 ms 43356 KB Output is correct
18 Correct 17 ms 43404 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 43608 KB Output is correct
2 Correct 18 ms 43380 KB Output is correct
3 Correct 17 ms 43352 KB Output is correct
4 Correct 18 ms 43352 KB Output is correct
5 Correct 16 ms 43476 KB Output is correct
6 Correct 18 ms 43352 KB Output is correct
7 Correct 17 ms 43356 KB Output is correct
8 Correct 17 ms 43468 KB Output is correct
9 Correct 17 ms 43280 KB Output is correct
10 Correct 16 ms 43352 KB Output is correct
11 Correct 16 ms 43468 KB Output is correct
12 Correct 17 ms 43356 KB Output is correct
13 Correct 21 ms 43352 KB Output is correct
14 Correct 16 ms 43356 KB Output is correct
15 Correct 18 ms 43356 KB Output is correct
16 Correct 17 ms 43356 KB Output is correct
17 Correct 17 ms 43352 KB Output is correct
18 Correct 17 ms 43356 KB Output is correct
19 Correct 17 ms 43356 KB Output is correct
20 Correct 16 ms 43484 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 43352 KB Output is correct
2 Correct 17 ms 43356 KB Output is correct
3 Correct 18 ms 43312 KB Output is correct
4 Correct 18 ms 43292 KB Output is correct
5 Correct 17 ms 43356 KB Output is correct
6 Correct 17 ms 43356 KB Output is correct
7 Correct 20 ms 43356 KB Output is correct
8 Correct 17 ms 43352 KB Output is correct
9 Correct 22 ms 43612 KB Output is correct
10 Correct 18 ms 43356 KB Output is correct
11 Correct 18 ms 43352 KB Output is correct
12 Correct 17 ms 43356 KB Output is correct
13 Correct 17 ms 43356 KB Output is correct
14 Correct 16 ms 43356 KB Output is correct
15 Correct 16 ms 43416 KB Output is correct
16 Correct 17 ms 43352 KB Output is correct
17 Correct 16 ms 43356 KB Output is correct
18 Correct 17 ms 43404 KB Output is correct
19 Correct 17 ms 43608 KB Output is correct
20 Correct 18 ms 43380 KB Output is correct
21 Correct 17 ms 43352 KB Output is correct
22 Correct 18 ms 43352 KB Output is correct
23 Correct 16 ms 43476 KB Output is correct
24 Correct 18 ms 43352 KB Output is correct
25 Correct 17 ms 43356 KB Output is correct
26 Correct 17 ms 43468 KB Output is correct
27 Correct 17 ms 43280 KB Output is correct
28 Correct 16 ms 43352 KB Output is correct
29 Correct 16 ms 43468 KB Output is correct
30 Correct 17 ms 43356 KB Output is correct
31 Correct 21 ms 43352 KB Output is correct
32 Correct 16 ms 43356 KB Output is correct
33 Correct 18 ms 43356 KB Output is correct
34 Correct 17 ms 43356 KB Output is correct
35 Correct 17 ms 43352 KB Output is correct
36 Correct 17 ms 43356 KB Output is correct
37 Correct 17 ms 43356 KB Output is correct
38 Correct 16 ms 43484 KB Output is correct
39 Correct 16 ms 43356 KB Output is correct
40 Correct 18 ms 43336 KB Output is correct
41 Correct 23 ms 43348 KB Output is correct
42 Correct 18 ms 43356 KB Output is correct
43 Correct 17 ms 43428 KB Output is correct
44 Correct 17 ms 43356 KB Output is correct
45 Correct 18 ms 43416 KB Output is correct
46 Correct 17 ms 43356 KB Output is correct
47 Correct 17 ms 43504 KB Output is correct
48 Correct 18 ms 43356 KB Output is correct
49 Correct 19 ms 43348 KB Output is correct
50 Correct 24 ms 43352 KB Output is correct
51 Correct 17 ms 43608 KB Output is correct
52 Correct 17 ms 43356 KB Output is correct
53 Correct 17 ms 43352 KB Output is correct
54 Correct 17 ms 43356 KB Output is correct
55 Correct 18 ms 43488 KB Output is correct
56 Correct 17 ms 43356 KB Output is correct
57 Correct 18 ms 43304 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 43352 KB Output is correct
2 Correct 17 ms 43356 KB Output is correct
3 Correct 18 ms 43312 KB Output is correct
4 Correct 18 ms 43292 KB Output is correct
5 Correct 17 ms 43356 KB Output is correct
6 Correct 17 ms 43356 KB Output is correct
7 Correct 20 ms 43356 KB Output is correct
8 Correct 17 ms 43352 KB Output is correct
9 Correct 22 ms 43612 KB Output is correct
10 Correct 18 ms 43356 KB Output is correct
11 Correct 18 ms 43352 KB Output is correct
12 Correct 17 ms 43356 KB Output is correct
13 Correct 17 ms 43356 KB Output is correct
14 Correct 16 ms 43356 KB Output is correct
15 Correct 16 ms 43416 KB Output is correct
16 Correct 17 ms 43352 KB Output is correct
17 Correct 16 ms 43356 KB Output is correct
18 Correct 17 ms 43404 KB Output is correct
19 Correct 17 ms 43608 KB Output is correct
20 Correct 18 ms 43380 KB Output is correct
21 Correct 17 ms 43352 KB Output is correct
22 Correct 18 ms 43352 KB Output is correct
23 Correct 16 ms 43476 KB Output is correct
24 Correct 18 ms 43352 KB Output is correct
25 Correct 17 ms 43356 KB Output is correct
26 Correct 17 ms 43468 KB Output is correct
27 Correct 17 ms 43280 KB Output is correct
28 Correct 16 ms 43352 KB Output is correct
29 Correct 16 ms 43468 KB Output is correct
30 Correct 17 ms 43356 KB Output is correct
31 Correct 21 ms 43352 KB Output is correct
32 Correct 16 ms 43356 KB Output is correct
33 Correct 18 ms 43356 KB Output is correct
34 Correct 17 ms 43356 KB Output is correct
35 Correct 17 ms 43352 KB Output is correct
36 Correct 17 ms 43356 KB Output is correct
37 Correct 17 ms 43356 KB Output is correct
38 Correct 16 ms 43484 KB Output is correct
39 Correct 16 ms 43356 KB Output is correct
40 Correct 18 ms 43336 KB Output is correct
41 Correct 23 ms 43348 KB Output is correct
42 Correct 18 ms 43356 KB Output is correct
43 Correct 17 ms 43428 KB Output is correct
44 Correct 17 ms 43356 KB Output is correct
45 Correct 18 ms 43416 KB Output is correct
46 Correct 17 ms 43356 KB Output is correct
47 Correct 17 ms 43504 KB Output is correct
48 Correct 18 ms 43356 KB Output is correct
49 Correct 19 ms 43348 KB Output is correct
50 Correct 24 ms 43352 KB Output is correct
51 Correct 17 ms 43608 KB Output is correct
52 Correct 17 ms 43356 KB Output is correct
53 Correct 17 ms 43352 KB Output is correct
54 Correct 17 ms 43356 KB Output is correct
55 Correct 18 ms 43488 KB Output is correct
56 Correct 17 ms 43356 KB Output is correct
57 Correct 18 ms 43304 KB Output is correct
58 Correct 20 ms 43612 KB Output is correct
59 Correct 20 ms 43864 KB Output is correct
60 Correct 23 ms 43868 KB Output is correct
61 Correct 44 ms 43980 KB Output is correct
62 Correct 98 ms 44568 KB Output is correct
63 Correct 25 ms 44368 KB Output is correct
64 Correct 60 ms 44368 KB Output is correct
65 Correct 17 ms 43352 KB Output is correct
66 Correct 17 ms 43356 KB Output is correct
67 Correct 17 ms 43468 KB Output is correct
68 Correct 22 ms 43608 KB Output is correct
69 Correct 17 ms 43356 KB Output is correct
70 Correct 18 ms 43388 KB Output is correct
71 Correct 25 ms 43608 KB Output is correct
72 Correct 17 ms 43608 KB Output is correct
73 Correct 18 ms 43408 KB Output is correct
74 Correct 19 ms 43852 KB Output is correct
75 Correct 20 ms 43868 KB Output is correct
76 Correct 44 ms 43808 KB Output is correct
77 Correct 95 ms 44380 KB Output is correct
78 Correct 25 ms 44368 KB Output is correct
79 Correct 55 ms 44380 KB Output is correct
80 Correct 24 ms 44368 KB Output is correct
81 Correct 28 ms 44368 KB Output is correct
82 Correct 92 ms 44564 KB Output is correct
83 Correct 17 ms 43356 KB Output is correct
84 Correct 18 ms 43356 KB Output is correct
85 Correct 27 ms 43608 KB Output is correct
86 Correct 17 ms 43612 KB Output is correct
87 Correct 18 ms 43612 KB Output is correct
88 Correct 19 ms 43884 KB Output is correct
89 Correct 21 ms 44124 KB Output is correct
90 Correct 52 ms 44120 KB Output is correct
91 Correct 126 ms 44856 KB Output is correct
92 Correct 27 ms 44728 KB Output is correct
93 Correct 68 ms 44856 KB Output is correct
94 Correct 18 ms 43612 KB Output is correct
95 Correct 24 ms 43468 KB Output is correct
96 Correct 17 ms 43352 KB Output is correct
97 Correct 22 ms 43356 KB Output is correct
98 Correct 19 ms 43524 KB Output is correct
99 Correct 22 ms 43376 KB Output is correct