제출 #647567

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647567		x0r	K blocks (IZhO14_blocks)	C++17	53 / 100	1093 ms	2388 KiB

blocks

#pragma GCC optimize ("O2")
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define fi first 
#define se second
#define pll pair < ll, ll >
#define pii pair < int, int >
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

using namespace std;

const string NAME = "";
const string NAME2 = "TEST";
const ld ESP = 1e-9;
const ll INF = 1e9 + 7;
const ll LINF = 1E18;
const ll nmax = 2e5;
const ll MOD = 1e9 + 7;
const ll base = 2309;

void fre() {
	string finp = NAME + ".inp";
	string fout = NAME + ".out";
	freopen(finp.c_str(), "r", stdin);
	freopen(fout.c_str(), "w", stdout);
} 

int n, k, a[100003], dp[103][100003], st[100003][23];

int get(int l, int r) {
	int k = log2(r - l + 1);
	return max(st[l][k], st[r - (1 << k) + 1][k]);
}

int main() {
	fast;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		st[i][0] = a[i];
	}
	for (int j = 1; (1 << j) <= n; j++) 
		for (int i = 1; i + (1 << j) - 1 <= n; i++) 
			st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
	for (int i = 2; i <= k; i++)
		for (int j = 1; j <= n; j++) dp[i][j] = INF;
	for (int i = 1; i <= n; i++) dp[1][i] = get(1, i);
	for (int i = 2; i <= k; i++) 
		for (int j = i; j <= n; j++)
			for (int k = j - 1; k >= i - 1; k--) 
				dp[i][j] = min(dp[i][j], dp[i - 1][k] + get(k + 1, j));
	cout << dp[k][n];
}

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp: In function 'void fre()':
blocks.cpp:26:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  freopen(finp.c_str(), "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:27:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  freopen(fout.c_str(), "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 18 / 18
• Subtask 3: 21 / 21
• Subtask 4: 0 / 47