oj.uz

Submission #639350

# Submission time Handle Problem Language Result Execution time Memory
639350 2022-09-09T14:40:06 Z LeticiaFCS K blocks (IZhO14_blocks) C++17
100 / 100
 235 ms 82836 KB 
#include "bits/stdc++.h"
#define MIN_DP first
#define MAX_A second
using lint = long long;
const lint INF = 0x3f3f3f3f;
using namespace std;

//21+18+14 pts


lint dp[102][100002];
lint a[100002];

int n, k; 

using str = pair<lint, lint>; // mindp_suf, max_a_suf


void init(){
	for(int qtd = 0; qtd <= k; qtd++)
		for(int i=0; i<=n; i++)
			dp[qtd][i] = INF;
	
	dp[1][1] = a[1];
	for(int i=2; i <=n; i++)
		dp[1][i] = max(dp[1][i-1], a[i]);

}

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	
	cin>>n>>k;
	for(int i=1; i<= n; i++)
		cin>>a[i];
	
	init();
	
	for(int qtd=2; qtd <=k; qtd++){
		vector<str> stack;
		for(int i=1; i<=n; i++){
			lint min_dp = dp[qtd-1][i-1];
			
			//se eu não der pop encontrei um a[j] > a[i] então tudo bem :D
			while(!stack.empty() && stack.back().MAX_A < a[i]){
				min_dp = min(min_dp, stack.back().MIN_DP);
				stack.pop_back();
			}
			
			// como min_dp[j] < min_dp_atual (já que a[j] > a[i]) se eu não melhoro o min_dp + a[i] posso jogar fora porque o próximo min_dp[j] é menor com certeza!!
			 
			if(stack.empty() || min_dp + a[i] < stack.back().MAX_A + stack.back().MIN_DP){
				stack.push_back({min_dp, a[i]});
			}
			
			if(i >= qtd)
				dp[qtd][i] = stack.back().MIN_DP + stack.back().MAX_A;
		}
	}
	cout<<dp[k][n]<<"\n";
	

	return 0;
}
/*
[  ]Leu o problema certo???
[  ]Ver se precisa de long long
[  ]Viu o limite dos fors (é n? é m?)
[  ]Tamanho do vetor, será que é 2e5 em vez de 1e5??
[  ]Testar sample
[  ]Testar casos de  borda
[  ]1LL no 1LL << i
[  ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?)
*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 596 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 0 ms 468 KB Output is correct
53 Correct 1 ms 852 KB Output is correct
54 Correct 1 ms 864 KB Output is correct
55 Correct 0 ms 596 KB Output is correct
56 Correct 1 ms 852 KB Output is correct
57 Correct 1 ms 856 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 596 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 0 ms 468 KB Output is correct
53 Correct 1 ms 852 KB Output is correct
54 Correct 1 ms 864 KB Output is correct
55 Correct 0 ms 596 KB Output is correct
56 Correct 1 ms 852 KB Output is correct
57 Correct 1 ms 856 KB Output is correct
58 Correct 4 ms 2524 KB Output is correct
59 Correct 5 ms 1624 KB Output is correct
60 Correct 7 ms 3808 KB Output is correct
61 Correct 45 ms 28100 KB Output is correct
62 Correct 115 ms 80848 KB Output is correct
63 Correct 10 ms 4932 KB Output is correct
64 Correct 56 ms 37788 KB Output is correct
65 Correct 1 ms 476 KB Output is correct
66 Correct 1 ms 596 KB Output is correct
67 Correct 1 ms 596 KB Output is correct
68 Correct 1 ms 596 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 1 ms 460 KB Output is correct
71 Correct 13 ms 8916 KB Output is correct
72 Correct 1 ms 724 KB Output is correct
73 Correct 4 ms 2648 KB Output is correct
74 Correct 4 ms 1624 KB Output is correct
75 Correct 7 ms 3796 KB Output is correct
76 Correct 39 ms 28124 KB Output is correct
77 Correct 101 ms 80716 KB Output is correct
78 Correct 11 ms 4804 KB Output is correct
79 Correct 51 ms 37780 KB Output is correct
80 Correct 12 ms 3284 KB Output is correct
81 Correct 18 ms 10328 KB Output is correct
82 Correct 113 ms 80844 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 468 KB Output is correct
85 Correct 24 ms 9132 KB Output is correct
86 Correct 2 ms 852 KB Output is correct
87 Correct 6 ms 2868 KB Output is correct
88 Correct 4 ms 1624 KB Output is correct
89 Correct 10 ms 4592 KB Output is correct
90 Correct 83 ms 29168 KB Output is correct
91 Correct 235 ms 82836 KB Output is correct
92 Correct 14 ms 6060 KB Output is correct
93 Correct 114 ms 39500 KB Output is correct
94 Correct 1 ms 664 KB Output is correct
95 Correct 13 ms 8920 KB Output is correct
96 Correct 1 ms 468 KB Output is correct
97 Correct 1 ms 332 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 0 ms 344 KB Output is correct