oj.uz

답안 #867954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867954 2023-10-30T01:50:45 Z mgl_diamond K개의 묶음 (IZhO14_blocks) C++17
0 / 100
 1 ms 2004 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;

#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define file "input"

void setIO() {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  if (fopen(file".inp", "r")) {
    freopen(file".inp", "r", stdin);
    freopen(file".out", "w", stdout);
  }
}

const ll INF = 1e18;
const int N = 1e5+5, K = 1e2+2;

int n, k;
ll a[N], prv[N], cur[N], f[N];

int main() {
  setIO();

  cin >> n >> k;
  foru(i, 1, n) {
    cin >> a[i];
    prv[i] = max(prv[i-1], a[i]);
  }

  foru(i, 2, k) {
    stack<int> st;
    memset(f, 0x3f, sizeof(f));
    memset(cur, 0x3f, sizeof(cur));

    foru(j, 1, n) {
      f[j] = prv[j];
      while (!st.empty() && a[st.top()] <= a[j]) {
        f[j] = min(f[j], f[st.top()]);
        st.pop();
      }

      if (f[j] < INF) cur[j] = min(cur[j], f[j] + a[j]);
      if (!st.empty()) cur[j] = min(cur[j], cur[st.top()]);

      st.push(j);
    }

//    foru(j, 1, n) {
//      cout << cur[j] << " ";
//    }
//    cout << "\n";

    foru(j, 1, n) {
      prv[j] = cur[j];
    }
  }

  cout << prv[n];
}

Compilation message

blocks.cpp: In function 'void setIO()':
blocks.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen(file".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:20:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     freopen(file".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Incorrect 1 ms 1884 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2004 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1996 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Incorrect 1 ms 1884 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Incorrect 1 ms 1884 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Incorrect 1 ms 1884 KB Output isn't correct
11 Halted 0 ms 0 KB -