oj.uz

답안 #1083583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083583 2024-09-03T14:20:16 Z f0rizen K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 456 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll infll = 1e18;

template<typename T>
istream &operator>>(istream &is, vector<T> &a) {
    for (auto &i : a) {
        is >> i;
    }
    return is;
}

int32_t main() {
#ifdef LOCAL
    freopen("/tmp/input.txt", "r", stdin);
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    cin >> a;
    vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, infll));
    dp[0][0] = 0;
    for (int j = 1; j <= k; ++j) {
        vector<int> st;
        vector<ll> mn;
        vector<ll> pref;
        for (int i = 1; i <= n; ++i) {
            ll cur = dp[j - 1][i - 1];
            while (!st.empty() && a[st.back()] <= a[i - 1]) {
                cur = min(cur, mn.back());
                st.pop_back();
                pref.pop_back();
            }
            st.push_back(i - 1);
            mn.push_back(cur);
            if (pref.empty()) {
                pref.push_back(cur + a[i - 1]);
            } else {
                pref.push_back(min(pref.back(), cur + a[i - 1]));
            }
            dp[j][i] = pref.back();
        }
    }
    cout << dp[k][n] << "\n";
    return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Incorrect 1 ms 452 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -