oj.uz

답안 #335077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335077 2020-12-11T05:21:56 Z VROOM_VARUN K개의 묶음 (IZhO14_blocks) C++14
53 / 100
 1000 ms 50028 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

int n, k;

VI vals;

int curk = 0;
const int MAXN = 1e5 + 2;
const int K = 20;
const int MAXK = 102;
int lg2[MAXN + 1];
int dp[MAXK][MAXN] = {};

void init() {
  vals.resize(n);
  lg2[1] = 0;
  for (int i = 2; i <= MAXN; i++) lg2[i] = lg2[i / 2] + 1;
}

int st[MAXN][K + 1];

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

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

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

// can we do dnc opt :eyes:
// oops we can't :sadge:
// we can solve using segment tree, but im worried it will tle
// rmq it is lmao

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("kblocks.in", "r", stdin);
  // freopen("kblocks.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> k;

  init();

  for (int i = 0; i < n; i++) {
    cin >> vals[i];
  }

  VI lft(n + 1, 0);

  rep(i, 0, MAXK) rep(j, 0, MAXN) dp[i][j] = INF;

  dp[0][0] = 0;
  calc(0);

  stack<int> st;
  vals.insert(vals.begin(), INF);
  st.push(0);

  for (int i = 1; i <= n; i++) {
    while (!st.empty() and vals[st.top()] <= vals[i]) st.pop();
    if (st.empty())
      lft[i] = -1;
    else
      lft[i] = st.top();
    st.push(i);
  }

  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      dp[i][j] = qry(lft[j], j - 1) + vals[j];
      if (lft[j] != -1) dp[i][j] = min(dp[i][j], dp[i][lft[j]]);
    }
    calc(i);
  }

  cout << dp[k][n] << '\n';

  return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 40684 KB Output is correct
2 Correct 32 ms 40684 KB Output is correct
3 Correct 30 ms 40684 KB Output is correct
4 Correct 31 ms 40684 KB Output is correct
5 Correct 31 ms 40684 KB Output is correct
6 Correct 31 ms 40684 KB Output is correct
7 Correct 30 ms 40684 KB Output is correct
8 Correct 31 ms 40684 KB Output is correct
9 Correct 32 ms 40812 KB Output is correct
10 Correct 31 ms 40684 KB Output is correct
11 Correct 32 ms 40684 KB Output is correct
12 Correct 31 ms 40684 KB Output is correct
13 Correct 31 ms 40684 KB Output is correct
14 Correct 31 ms 40684 KB Output is correct
15 Correct 32 ms 40684 KB Output is correct
16 Correct 31 ms 40684 KB Output is correct
17 Correct 31 ms 40684 KB Output is correct
18 Correct 31 ms 40684 KB Output is correct
19 Correct 31 ms 40684 KB Output is correct
20 Correct 29 ms 40684 KB Output is correct
21 Correct 34 ms 40684 KB Output is correct
22 Correct 30 ms 40684 KB Output is correct
23 Correct 31 ms 40684 KB Output is correct
24 Correct 30 ms 40684 KB Output is correct
25 Correct 31 ms 40684 KB Output is correct
26 Correct 30 ms 40684 KB Output is correct
27 Correct 31 ms 40684 KB Output is correct
28 Correct 31 ms 40684 KB Output is correct
29 Correct 31 ms 40648 KB Output is correct
30 Correct 30 ms 40684 KB Output is correct
31 Correct 31 ms 40684 KB Output is correct
32 Correct 31 ms 40684 KB Output is correct
33 Correct 30 ms 40684 KB Output is correct
34 Correct 30 ms 40684 KB Output is correct
35 Correct 32 ms 40684 KB Output is correct
36 Correct 31 ms 40684 KB Output is correct
37 Correct 30 ms 40684 KB Output is correct
38 Correct 30 ms 40684 KB Output is correct
39 Correct 29 ms 40676 KB Output is correct
40 Correct 32 ms 40684 KB Output is correct
41 Correct 30 ms 40684 KB Output is correct
42 Correct 31 ms 40684 KB Output is correct
43 Correct 31 ms 40684 KB Output is correct
44 Correct 30 ms 40684 KB Output is correct
45 Correct 30 ms 40684 KB Output is correct
46 Correct 31 ms 40664 KB Output is correct
47 Correct 32 ms 40684 KB Output is correct
48 Correct 30 ms 40684 KB Output is correct
49 Correct 30 ms 40684 KB Output is correct
50 Correct 31 ms 40684 KB Output is correct
51 Correct 31 ms 40684 KB Output is correct
52 Correct 31 ms 40684 KB Output is correct
53 Correct 31 ms 40684 KB Output is correct
54 Correct 31 ms 40684 KB Output is correct
55 Correct 30 ms 40684 KB Output is correct
56 Correct 30 ms 40684 KB Output is correct
57 Correct 31 ms 40684 KB Output is correct
58 Correct 40 ms 41580 KB Output is correct
59 Correct 39 ms 44908 KB Output is correct
60 Correct 56 ms 44780 KB Output is correct
61 Correct 165 ms 44780 KB Output is correct
62 Execution timed out 1095 ms 50028 KB Time limit exceeded
63 Halted 0 ms 0 KB -