oj.uz

답안 #341357

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341357 2020-12-29T14:31:04 Z amunduzbaev K개의 묶음 (IZhO14_blocks) C++14
100 / 100
 201 ms 81704 KB 
/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define int long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

int n, m, k, ans, dp[105][N], a[N];

void solve(){
	cin>>n>>m;
	k = m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) dp[1][i] = max(dp[1][i-1] , a[i]);
	for(int i=2;i<=k;i++){
		for(int j=1;j<=n;j++) dp[i][j] = mod;
	}
	
	for(int i=2;i<=k;i++){
		stack<pii> ss;
		for(int j=i;j<=n;j++){
			int tmp = dp[i-1][j-1];
			
			while(!ss.empty() && ss.top().ff <= a[j]) { umin(tmp, ss.top().ss); ss.pop(); }
			
			if(ss.empty() || ss.top().ff + ss.top().ss >= tmp+a[j]) ss.push({a[j], tmp});
			dp[i][j] = tmp + a[j];
			
			if(!ss.empty()) umin(dp[i][j], ss.top().ff + ss.top().ss);
		}
	}
	
	cout<<dp[k][n];
	return;
}

/*

9 3
2 5 1 7 3 4 3 2 1

*/

main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
}

Compilation message

blocks.cpp:70:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main(){
      |      ^

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 748 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 620 KB Output is correct
52 Correct 1 ms 620 KB Output is correct
53 Correct 2 ms 1260 KB Output is correct
54 Correct 1 ms 1260 KB Output is correct
55 Correct 1 ms 748 KB Output is correct
56 Correct 1 ms 1260 KB Output is correct
57 Correct 1 ms 1260 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 748 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 620 KB Output is correct
52 Correct 1 ms 620 KB Output is correct
53 Correct 2 ms 1260 KB Output is correct
54 Correct 1 ms 1260 KB Output is correct
55 Correct 1 ms 748 KB Output is correct
56 Correct 1 ms 1260 KB Output is correct
57 Correct 1 ms 1260 KB Output is correct
58 Correct 5 ms 2668 KB Output is correct
59 Correct 5 ms 1388 KB Output is correct
60 Correct 9 ms 3436 KB Output is correct
61 Correct 61 ms 28140 KB Output is correct
62 Correct 143 ms 80996 KB Output is correct
63 Correct 14 ms 4224 KB Output is correct
64 Correct 69 ms 37356 KB Output is correct
65 Correct 1 ms 620 KB Output is correct
66 Correct 1 ms 748 KB Output is correct
67 Correct 1 ms 748 KB Output is correct
68 Correct 1 ms 748 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 492 KB Output is correct
71 Correct 17 ms 9068 KB Output is correct
72 Correct 2 ms 620 KB Output is correct
73 Correct 7 ms 2668 KB Output is correct
74 Correct 8 ms 1388 KB Output is correct
75 Correct 9 ms 3564 KB Output is correct
76 Correct 49 ms 28140 KB Output is correct
77 Correct 133 ms 80876 KB Output is correct
78 Correct 14 ms 4204 KB Output is correct
79 Correct 70 ms 37356 KB Output is correct
80 Correct 11 ms 2668 KB Output is correct
81 Correct 22 ms 9708 KB Output is correct
82 Correct 141 ms 80876 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 492 KB Output is correct
85 Correct 19 ms 9196 KB Output is correct
86 Correct 2 ms 748 KB Output is correct
87 Correct 6 ms 2668 KB Output is correct
88 Correct 7 ms 1388 KB Output is correct
89 Correct 14 ms 3828 KB Output is correct
90 Correct 67 ms 28388 KB Output is correct
91 Correct 201 ms 81704 KB Output is correct
92 Correct 15 ms 4716 KB Output is correct
93 Correct 96 ms 38048 KB Output is correct
94 Correct 2 ms 620 KB Output is correct
95 Correct 17 ms 9196 KB Output is correct
96 Correct 1 ms 492 KB Output is correct
97 Correct 1 ms 364 KB Output is correct
98 Correct 1 ms 364 KB Output is correct
99 Correct 1 ms 364 KB Output is correct