답안 #38981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
38981	2018-01-09T02:41:24 Z	RockyB	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	1000 ms	45928 KB

blocks

/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)1e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, k;
int a[N];
int dp[111][N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	memset(dp, 0x3f3f, sizeof(dp));
	dp[0][0] = 0;
	for (int o = 1; o <= k; o++) {
		for (int i = 1; i <= n; i++) {
			int mx = a[i];
			for (int j = i; j >= 1; j--) {
				mx = max(mx, a[j]);
				dp[o][i] = min(dp[o][i], dp[o - 1][j - 1] + mx);
			}
		}
	}
	cout << dp[k][n];
	ioi
}

Subtask #1

14.0 / 14.0

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

Subtask #2

18.0 / 18.0

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

Subtask #3

21.0 / 21.0

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

Subtask #4

0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1000 ms	45928 KB	Execution timed out
2	Halted	0 ms	0 KB	-