답안 #854801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
854801	2023-09-29T02:41:37 Z	NeroZein	K개의 묶음 (IZhO14_blocks)	C++17	0 / 100	1 ms	460 KB

blocks

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

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  vector<vector<long long>> dp(k, vector<long long> (n)); 
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    dp[0][i] = a[i];
    if (i) {
      dp[0][i] = max(dp[0][i], dp[0][i - 1]); 
    } 
  }
  for (int j = 1; j < k; ++j) {
    stack<pair<int, long long>> stk; 
    for (int i = j; i < n; ++i) {
      long long x = dp[j - 1][i - 1]; 
      while (!stk.empty() && stk.top().second <= a[i]) {
        x = stk.top().second; 
        stk.pop(); 
      }
      if (stk.empty() || (stk.top().first + stk.top().second > a[i] + x)) {
        stk.push({a[i], x});
      }
      dp[j][i] = stk.top().first + stk.top().second; 
      //deb(stk.top());deb(dp[j][i]); cout << '\n';
    }
  }
  cout << dp[k - 1][n - 1] << '\n'; 
  return 0;
}

Subtask #1

0 / 14.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	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 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	1 ms	348 KB	Output is correct
10	Incorrect	1 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #2

0 / 18.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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	456 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	460 KB	Output is correct
10	Incorrect	0 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.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	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 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	1 ms	348 KB	Output is correct
10	Incorrect	1 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #4

0 / 47.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	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 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	1 ms	348 KB	Output is correct
10	Incorrect	1 ms	348 KB	Output isn't correct
11	Halted	0 ms	0 KB	-