oj.uz

Submission #335087

# Submission time Handle Problem Language Result Execution time Memory
335087 2020-12-11T05:40:48 Z VROOM_VARUN K blocks (IZhO14_blocks) C++14
100 / 100
 272 ms 48620 KB 
/*
ID: varunra2
LANG: C++
TASK: kblocks
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

const int MAXN = 1e5 + 2, K = 18, MAXK = 102;
int n, k, vals[MAXN], lft[MAXN], lg2[MAXN + 1], st[K + 1][MAXN],
    dp[MAXK][MAXN] = {};

void calc(int ind) {
  for (int i = 0; i <= n; i++) st[0][i] = dp[ind][i];

  for (int j = 1; (1 << j) <= MAXN; j++)
    for (int i = 0; (1 << j) + i <= n + 1; i++)
      st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
}

int qry(int L, int R) {
  int j = lg2[R - L + 1];
  return min(st[j][L], st[j][R - (1 << j) + 1]);
}

int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  lg2[1] = 0;
  for (int i = 2; i <= MAXN; i++) lg2[i] = lg2[i / 2] + 1;
  for (int i = 1; i <= n; i++) {
    cin >> vals[i];
  }
  rep(i, 0, MAXK) rep(j, 0, MAXN) dp[i][j] = INF;
  dp[0][0] = 0;
  stack<int> st;
  vals[0] = INF;
  st.push(0);
  for (int i = 1; i <= n; i++) {
    while (vals[st.top()] <= vals[i]) st.pop();
    lft[i] = st.top();
    st.push(i);
  }
  calc(0);
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      dp[i][j] = min(qry(lft[j], j - 1) + vals[j], dp[i][lft[j]]);
    }
    calc(i);
  }
  cout << dp[k][n] << '\n';
  return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 40684 KB Output is correct
2 Correct 26 ms 40684 KB Output is correct
3 Correct 26 ms 40684 KB Output is correct
4 Correct 26 ms 40684 KB Output is correct
5 Correct 26 ms 40684 KB Output is correct
6 Correct 27 ms 40684 KB Output is correct
7 Correct 27 ms 40684 KB Output is correct
8 Correct 27 ms 40684 KB Output is correct
9 Correct 26 ms 40684 KB Output is correct
10 Correct 27 ms 40720 KB Output is correct
11 Correct 27 ms 40812 KB Output is correct
12 Correct 26 ms 40684 KB Output is correct
13 Correct 28 ms 40684 KB Output is correct
14 Correct 27 ms 40684 KB Output is correct
15 Correct 26 ms 40684 KB Output is correct
16 Correct 26 ms 40684 KB Output is correct
17 Correct 27 ms 40684 KB Output is correct
18 Correct 28 ms 40684 KB Output is correct

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 40684 KB Output is correct
2 Correct 26 ms 40684 KB Output is correct
3 Correct 26 ms 40684 KB Output is correct
4 Correct 26 ms 40684 KB Output is correct
5 Correct 26 ms 40684 KB Output is correct
6 Correct 27 ms 40684 KB Output is correct
7 Correct 27 ms 40684 KB Output is correct
8 Correct 27 ms 40684 KB Output is correct
9 Correct 26 ms 40684 KB Output is correct
10 Correct 27 ms 40720 KB Output is correct
11 Correct 27 ms 40812 KB Output is correct
12 Correct 26 ms 40684 KB Output is correct
13 Correct 28 ms 40684 KB Output is correct
14 Correct 27 ms 40684 KB Output is correct
15 Correct 26 ms 40684 KB Output is correct
16 Correct 26 ms 40684 KB Output is correct
17 Correct 27 ms 40684 KB Output is correct
18 Correct 28 ms 40684 KB Output is correct
19 Correct 27 ms 40684 KB Output is correct
20 Correct 26 ms 40684 KB Output is correct
21 Correct 27 ms 40684 KB Output is correct
22 Correct 26 ms 40676 KB Output is correct
23 Correct 26 ms 40684 KB Output is correct
24 Correct 26 ms 40684 KB Output is correct
25 Correct 26 ms 40684 KB Output is correct
26 Correct 26 ms 40684 KB Output is correct
27 Correct 28 ms 40684 KB Output is correct
28 Correct 28 ms 40684 KB Output is correct
29 Correct 26 ms 40684 KB Output is correct
30 Correct 26 ms 40684 KB Output is correct
31 Correct 27 ms 40684 KB Output is correct
32 Correct 26 ms 40684 KB Output is correct
33 Correct 27 ms 40684 KB Output is correct
34 Correct 27 ms 40684 KB Output is correct
35 Correct 27 ms 40684 KB Output is correct
36 Correct 27 ms 40684 KB Output is correct
37 Correct 27 ms 40684 KB Output is correct
38 Correct 26 ms 40684 KB Output is correct
39 Correct 26 ms 40684 KB Output is correct
40 Correct 27 ms 40684 KB Output is correct
41 Correct 27 ms 40684 KB Output is correct
42 Correct 27 ms 40684 KB Output is correct
43 Correct 26 ms 40684 KB Output is correct
44 Correct 26 ms 40684 KB Output is correct
45 Correct 27 ms 40684 KB Output is correct
46 Correct 31 ms 40684 KB Output is correct
47 Correct 26 ms 40684 KB Output is correct
48 Correct 26 ms 40684 KB Output is correct
49 Correct 27 ms 40684 KB Output is correct
50 Correct 26 ms 40684 KB Output is correct
51 Correct 27 ms 40684 KB Output is correct
52 Correct 27 ms 40684 KB Output is correct
53 Correct 27 ms 40684 KB Output is correct
54 Correct 27 ms 40684 KB Output is correct
55 Correct 27 ms 40684 KB Output is correct
56 Correct 28 ms 40684 KB Output is correct
57 Correct 26 ms 40684 KB Output is correct
58 Correct 32 ms 41324 KB Output is correct
59 Correct 34 ms 43884 KB Output is correct
60 Correct 40 ms 43884 KB Output is correct
61 Correct 102 ms 43628 KB Output is correct
62 Correct 258 ms 48236 KB Output is correct
63 Correct 51 ms 48364 KB Output is correct
64 Correct 140 ms 48236 KB Output is correct
65 Correct 26 ms 40684 KB Output is correct
66 Correct 27 ms 40684 KB Output is correct
67 Correct 26 ms 40684 KB Output is correct
68 Correct 27 ms 40684 KB Output is correct
69 Correct 32 ms 40812 KB Output is correct
70 Correct 27 ms 40812 KB Output is correct
71 Correct 48 ms 41324 KB Output is correct
72 Correct 28 ms 41324 KB Output is correct
73 Correct 32 ms 41324 KB Output is correct
74 Correct 34 ms 43884 KB Output is correct
75 Correct 39 ms 43884 KB Output is correct
76 Correct 101 ms 43956 KB Output is correct
77 Correct 270 ms 48236 KB Output is correct
78 Correct 49 ms 48236 KB Output is correct
79 Correct 147 ms 48236 KB Output is correct
80 Correct 44 ms 48236 KB Output is correct
81 Correct 69 ms 48364 KB Output is correct
82 Correct 272 ms 48236 KB Output is correct
83 Correct 26 ms 40812 KB Output is correct
84 Correct 27 ms 40812 KB Output is correct
85 Correct 47 ms 41408 KB Output is correct
86 Correct 28 ms 41324 KB Output is correct
87 Correct 32 ms 41324 KB Output is correct
88 Correct 34 ms 44012 KB Output is correct
89 Correct 39 ms 44012 KB Output is correct
90 Correct 100 ms 44028 KB Output is correct
91 Correct 257 ms 48492 KB Output is correct
92 Correct 49 ms 48492 KB Output is correct
93 Correct 143 ms 48620 KB Output is correct
94 Correct 28 ms 41324 KB Output is correct
95 Correct 45 ms 41324 KB Output is correct
96 Correct 27 ms 40812 KB Output is correct
97 Correct 26 ms 40812 KB Output is correct
98 Correct 26 ms 40684 KB Output is correct
99 Correct 28 ms 40812 KB Output is correct