oj.uz

답안 #391737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
391737 2021-04-19T16:05:11 Z saarang123 K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxn = 100 * 1000 + 3;
int seg[2 * mxn], l[mxn], r[mxn], a[mxn], p[mxn], dp[mxn][103], n, k, mx = 0;
 
signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    #ifdef saarang
    freopen("/home/saarang/Documents/cp/input.txt", "r", stdin);
    freopen("/home/saarang/Documents/cp/output.txt", "w", stdout);
    #endif
    cin >> n >> k;
    for(int i = 0; i <= n; i++)
        for(int j = 0; j <= n; j++)
            dp[i][j] = 1e9;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        l[i] = r[i] = i;
        l[i] = r[i] = i;
        mx = max(mx, a[i]);
        dp[1][i] = mx;
    }
    stack<int> s;
    for(int i = 1; i <= n; i++) {
        while(!s.empty() && a[s.top()] <= a[i])
            s.pop();
        l[i] = s.empty() ? 1 : s.top() + 1;
        s.push(i);
    }
    while(!s.empty()) s.pop();
    for(int i = n; i; i--) {
        while(!s.empty() && a[s.top()] <= a[i])
            s.pop();
        r[i] = s.empty() ? n : s.top() - 1;
        s.push(i);
    }
    // for(int i = 1; i <= n; i++)
    //  cout << l[i] << ' ' << r[i] << '\n';
    auto query = [&] (int i, int j) {
        int res = 1e9;
        i = max(1, i);
        if(i > j) return res;
        for(i += n - 1, j += n; i < j; i >>= 1, j >>= 1) {
            if(i & 1)
                res = min(res, seg[i++]);
            if(j & 1)
                res = min(res, seg[--j]);
        }
        return res;
    };
    for(int i = 2; i <= k; i++) {
        for(int j = 1; j <= n; j++)
            seg[n + j - 1] = dp[i - 1][j];
        for(int j = n - 1; j > 0; j--)
            seg[j] = min(seg[j << 1], seg[j << 1|1]);
        for(int j = i; j <= n; j++)
            dp[i][j] = a[j] + query(l[j] - 1, j - 1);
    }
    // for(int i = 1; i <= k; i++) {
    //  for(int j = 1; j <= n; j++)
    //      cout << dp[i][j] << ' ';
    //  cout << '\n';
    // }
    cout << dp[k][n] << '\n';
    return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Incorrect 1 ms 332 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Incorrect 1 ms 332 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Incorrect 1 ms 332 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Incorrect 1 ms 332 KB Output isn't correct
14 Halted 0 ms 0 KB -