답안 #990174

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
990174	2024-05-29T18:37:51 Z	tch1cherin	K개의 묶음 (IZhO14_blocks)	C++17	100 / 100	343 ms	5468 KB

blocks

// #pragma GCC optimize("O3")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;
 
inline int fast_min(int x, int y) {
  return x < y ? x : y;
}

struct dsu {
  vector<int> parent, rank;
  vector<int> min_val;
 
  dsu(int n) : parent(n), rank(n, 1) {
    iota(parent.begin(), parent.end(), 0);
  }
 
  int get(int u) {
    return parent[u] == u ? u : (parent[u] = get(parent[u]));
  }
 
  void unite(int u, int v) {
    u = get(u), v = get(v);
    if (u != v) {
      if (rank[u] < rank[v]) {
        swap(u, v);
      }
      rank[u] += rank[v];
      parent[v] = u;
      min_val[u] = min(min_val[u], min_val[v]);
    }
  }
};
 
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, K;
  cin >> N >> K;
  vector<int> A(N);
  for (int &value : A) {
    cin >> value;
  }
  vector<int> stleft(N), stright(N);
  for (int i = 0; i < N; i++) {
    stleft[i] = i - 1;
    while (stleft[i] != -1 && A[stleft[i]] < A[i]) {
      stleft[i] = stleft[stleft[i]];
    }
  }
  for (int i = N - 1; i >= 0; i--) {
    stright[i] = i + 1;
    while (stright[i] != N && A[stright[i]] <= A[i]) {
      stright[i] = stright[stright[i]];
    }
  }
  vector<int> dp(N + 1, INF), new_dp;
  dp[0] = 0;
  for (int k = 0; k < K; k++) {
    new_dp.assign(N + 1, INF);
    stack<int> st;
    stack<pair<int, int>> sta;
    dsu sets(N);
    sets.min_val = dp;
    vector<int> val(N);
    for (int i = 0; i <= N; i++) {
      new_dp[i] = sta.empty() ? INF : sta.top().second;
      if (i == N) {
        continue;
      }
      while (!st.empty() && dp[st.top()] > dp[i]) {
        sets.unite(st.top(), i);
        st.pop();
      }
      while (!sta.empty() && A[sta.top().first] < A[i]) {
        sta.pop();
      }
      val[i] = sets.min_val[sets.get(stleft[i] + 1)] + A[i];
      sta.push({i, min(val[i], sta.empty() ? INF : sta.top().second)});
      st.push(i);
    }
    dp = new_dp;
  }
  cout << dp.back() << "\n";
}

Subtask #1
14.0 / 14.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	344 KB	Output is correct
5	Correct	344 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	600 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	1 ms	344 KB	Output is correct
54	Correct	1 ms	344 KB	Output is correct
55	Correct	0 ms	344 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	4 ms	600 KB	Output is correct
59	Correct	6 ms	2140 KB	Output is correct
60	Correct	10 ms	2204 KB	Output is correct
61	Correct	76 ms	2352 KB	Output is correct
62	Correct	212 ms	4480 KB	Output is correct
63	Correct	13 ms	4412 KB	Output is correct
64	Correct	96 ms	4444 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	1 ms	348 KB	Output is correct
67	Correct	1 ms	348 KB	Output is correct
68	Correct	1 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	1 ms	348 KB	Output is correct
71	Correct	30 ms	604 KB	Output is correct
72	Correct	1 ms	604 KB	Output is correct
73	Correct	8 ms	604 KB	Output is correct
74	Correct	5 ms	2140 KB	Output is correct
75	Correct	13 ms	2204 KB	Output is correct
76	Correct	116 ms	2204 KB	Output is correct
77	Correct	338 ms	4412 KB	Output is correct
78	Correct	15 ms	4952 KB	Output is correct
79	Correct	154 ms	4944 KB	Output is correct
80	Correct	11 ms	4956 KB	Output is correct
81	Correct	38 ms	5068 KB	Output is correct
82	Correct	343 ms	4956 KB	Output is correct
83	Correct	0 ms	348 KB	Output is correct
84	Correct	1 ms	348 KB	Output is correct
85	Correct	28 ms	856 KB	Output is correct
86	Correct	1 ms	856 KB	Output is correct
87	Correct	7 ms	960 KB	Output is correct
88	Correct	5 ms	2652 KB	Output is correct
89	Correct	12 ms	2652 KB	Output is correct
90	Correct	97 ms	2652 KB	Output is correct
91	Correct	288 ms	5352 KB	Output is correct
92	Correct	15 ms	5468 KB	Output is correct
93	Correct	133 ms	5328 KB	Output is correct
94	Correct	1 ms	860 KB	Output is correct
95	Correct	15 ms	856 KB	Output is correct
96	Correct	1 ms	348 KB	Output is correct
97	Correct	0 ms	348 KB	Output is correct
98	Correct	0 ms	348 KB	Output is correct
99	Correct	1 ms	456 KB	Output is correct

답안 #990174

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 18.0 / 18.0

Subtask #3 21.0 / 21.0

Subtask #4 47.0 / 47.0

Subtask #1
14.0 / 14.0

Subtask #2
18.0 / 18.0

Subtask #3
21.0 / 21.0

Subtask #4
47.0 / 47.0