oj.uz

Submission #391727

# Submission time Handle Problem Language Result Execution time Memory
391727 2021-04-19T15:38:43 Z saarang123 K blocks (IZhO14_blocks) C++17
0 / 100
 24 ms 40656 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;
    memset(dp, 0x7f, sizeof dp);
    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;
    	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], j);
    }
    // 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

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40592 KB Output is correct
2 Correct 20 ms 40536 KB Output is correct
3 Correct 20 ms 40612 KB Output is correct
4 Correct 20 ms 40604 KB Output is correct
5 Correct 21 ms 40656 KB Output is correct
6 Correct 21 ms 40524 KB Output is correct
7 Correct 21 ms 40652 KB Output is correct
8 Correct 21 ms 40524 KB Output is correct
9 Correct 21 ms 40652 KB Output is correct
10 Incorrect 21 ms 40580 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 40652 KB Output is correct
2 Correct 21 ms 40548 KB Output is correct
3 Correct 20 ms 40584 KB Output is correct
4 Correct 23 ms 40652 KB Output is correct
5 Correct 21 ms 40560 KB Output is correct
6 Correct 20 ms 40620 KB Output is correct
7 Correct 24 ms 40652 KB Output is correct
8 Correct 21 ms 40556 KB Output is correct
9 Correct 24 ms 40616 KB Output is correct
10 Incorrect 21 ms 40524 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40592 KB Output is correct
2 Correct 20 ms 40536 KB Output is correct
3 Correct 20 ms 40612 KB Output is correct
4 Correct 20 ms 40604 KB Output is correct
5 Correct 21 ms 40656 KB Output is correct
6 Correct 21 ms 40524 KB Output is correct
7 Correct 21 ms 40652 KB Output is correct
8 Correct 21 ms 40524 KB Output is correct
9 Correct 21 ms 40652 KB Output is correct
10 Incorrect 21 ms 40580 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 40592 KB Output is correct
2 Correct 20 ms 40536 KB Output is correct
3 Correct 20 ms 40612 KB Output is correct
4 Correct 20 ms 40604 KB Output is correct
5 Correct 21 ms 40656 KB Output is correct
6 Correct 21 ms 40524 KB Output is correct
7 Correct 21 ms 40652 KB Output is correct
8 Correct 21 ms 40524 KB Output is correct
9 Correct 21 ms 40652 KB Output is correct
10 Incorrect 21 ms 40580 KB Output isn't correct
11 Halted 0 ms 0 KB -