답안 #343717

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
343717	2021-01-04T12:17:41 Z	IZhO_2021_I_want_Silver	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	11 ms	1772 KB

blocks

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 1e5 + 5;
const int oo = 1e9 + 5;

int n, K;
vector <pll> vec;
ll dp[105][N], a[N];

void solve() {
    cin >> n >> K;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; ++i) {
        for (int k = 1; k <= K; ++k) {
            dp[i][k] = oo;
        }
    }
    for (int i = 1; i <= n; ++i) {
        dp[i][1] = max(dp[i-1][1], a[i]);
    }
    for (int k = 2; k <= K; ++k) {
        for (int i = k; i <= n; ++i) {
            ll mn = dp[i - 1][k - 1];
            while (sz(vec) && a[vec.back().S] <= a[i]) {
                mn = min(mn, vec.back().F);
                vec.ppb();
            }
            dp[i][k] = mn + a[i];
            if (sz(vec)) { dp[i][k] = min(dp[i][k], dp[vec.back().S][k]); }
            vec.pb({mn, i});
        }
        vec.clear();
    }
    cout << dp[n][K];
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message

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

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 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	876 KB	Output is correct
13	Correct	1 ms	876 KB	Output is correct
14	Correct	1 ms	876 KB	Output is correct
15	Correct	1 ms	876 KB	Output is correct
16	Correct	1 ms	876 KB	Output is correct
17	Correct	1 ms	876 KB	Output is correct
18	Correct	1 ms	876 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	512 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	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	640 KB	Output is correct
18	Correct	1 ms	492 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	492 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 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	876 KB	Output is correct
13	Correct	1 ms	876 KB	Output is correct
14	Correct	1 ms	876 KB	Output is correct
15	Correct	1 ms	876 KB	Output is correct
16	Correct	1 ms	876 KB	Output is correct
17	Correct	1 ms	876 KB	Output is correct
18	Correct	1 ms	876 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	512 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	364 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	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	1 ms	492 KB	Output is correct
35	Correct	1 ms	640 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	1 ms	492 KB	Output is correct
39	Correct	2 ms	876 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	0 ms	364 KB	Output is correct
43	Correct	0 ms	364 KB	Output is correct
44	Correct	0 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	876 KB	Output is correct
52	Correct	1 ms	876 KB	Output is correct
53	Correct	1 ms	1004 KB	Output is correct
54	Correct	1 ms	1152 KB	Output is correct
55	Correct	1 ms	876 KB	Output is correct
56	Correct	1 ms	1004 KB	Output is correct
57	Correct	1 ms	1004 KB	Output is correct

Subtask #4
0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 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	876 KB	Output is correct
13	Correct	1 ms	876 KB	Output is correct
14	Correct	1 ms	876 KB	Output is correct
15	Correct	1 ms	876 KB	Output is correct
16	Correct	1 ms	876 KB	Output is correct
17	Correct	1 ms	876 KB	Output is correct
18	Correct	1 ms	876 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	512 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	364 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	492 KB	Output is correct
33	Correct	1 ms	492 KB	Output is correct
34	Correct	1 ms	492 KB	Output is correct
35	Correct	1 ms	640 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	1 ms	492 KB	Output is correct
39	Correct	2 ms	876 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	0 ms	364 KB	Output is correct
43	Correct	0 ms	364 KB	Output is correct
44	Correct	0 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	876 KB	Output is correct
52	Correct	1 ms	876 KB	Output is correct
53	Correct	1 ms	1004 KB	Output is correct
54	Correct	1 ms	1152 KB	Output is correct
55	Correct	1 ms	876 KB	Output is correct
56	Correct	1 ms	1004 KB	Output is correct
57	Correct	1 ms	1004 KB	Output is correct
58	Runtime error	11 ms	1772 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
59	Halted	0 ms	0 KB	-

답안 #343717

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 18.0 / 18.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 47.0

Subtask #1
14.0 / 14.0

Subtask #2
18.0 / 18.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 47.0