oj.uz

답안 #817408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817408 2023-08-09T12:19:44 Z vjudge1 Feast (NOI19_feast) C++17
40 / 100
 268 ms 14560 KB 
#include <bits/stdc++.h>
using namespace std;

void main_program();

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	main_program();
}

#define int long long

using ii = pair<int, int>;

int n, k;
vector<int> v, pfx;

ii better(ii a, ii b){
	if (a.first != b.first){
		return (a.first > b.first) ? a : b;
	}
	return (a.second < b.second) ? a : b;
}

ii f(int lambda){
	vector<ii> dp_closed(n), dp_open(n);
	dp_closed[0] = {0, 0};
	dp_open[0] = {max(0LL, -pfx[0]), 0};

	for (int i = 1; i < n; i++){
		dp_closed[i] = better(dp_closed[i-1],
			{dp_open[i-1].first + pfx[i] - lambda, dp_open[i-1].second + 1});
		dp_open[i] = better(dp_open[i-1],
			{dp_closed[i-1].first - pfx[i], dp_closed[i-1].second});
	}

	return dp_closed[n-1];
}

void main_program(){
	cin >> n >> k;

	v.resize(n);
	for (int i = 0; i < n; i++) cin >> v[i];
	pfx = v;
	for (int i = 1; i < n; i++) pfx[i] += pfx[i-1];

	int l = 0, r = 3e14;
	while (l <= r){
		int mid = (l + r) >> 1;
		auto res = f(mid);
		if (res.second <= k) r = mid - 1;
		else l = mid + 1;
	}

	auto res = f(l);
	cout << res.first + l * res.second << "\n";
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 14108 KB Output is correct
2 Correct 216 ms 14348 KB Output is correct
3 Correct 248 ms 14560 KB Output is correct
4 Correct 233 ms 14408 KB Output is correct
5 Correct 203 ms 14408 KB Output is correct
6 Correct 209 ms 14056 KB Output is correct
7 Correct 224 ms 14116 KB Output is correct
8 Correct 224 ms 14388 KB Output is correct
9 Correct 202 ms 14168 KB Output is correct
10 Correct 207 ms 14264 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 14196 KB Output is correct
2 Correct 230 ms 14480 KB Output is correct
3 Correct 211 ms 14160 KB Output is correct
4 Correct 215 ms 14296 KB Output is correct
5 Correct 240 ms 14288 KB Output is correct
6 Correct 227 ms 14236 KB Output is correct
7 Correct 222 ms 14536 KB Output is correct
8 Correct 268 ms 14496 KB Output is correct
9 Correct 237 ms 14044 KB Output is correct
10 Correct 253 ms 14428 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 268 ms 14400 KB Output is correct
2 Correct 241 ms 14184 KB Output is correct
3 Correct 246 ms 14332 KB Output is correct
4 Correct 220 ms 14252 KB Output is correct
5 Correct 267 ms 14372 KB Output is correct
6 Correct 227 ms 14376 KB Output is correct
7 Correct 228 ms 14456 KB Output is correct
8 Correct 248 ms 14320 KB Output is correct
9 Correct 222 ms 14536 KB Output is correct
10 Correct 230 ms 14516 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 209 ms 14108 KB Output is correct
2 Correct 216 ms 14348 KB Output is correct
3 Correct 248 ms 14560 KB Output is correct
4 Correct 233 ms 14408 KB Output is correct
5 Correct 203 ms 14408 KB Output is correct
6 Correct 209 ms 14056 KB Output is correct
7 Correct 224 ms 14116 KB Output is correct
8 Correct 224 ms 14388 KB Output is correct
9 Correct 202 ms 14168 KB Output is correct
10 Correct 207 ms 14264 KB Output is correct
11 Correct 216 ms 14196 KB Output is correct
12 Correct 230 ms 14480 KB Output is correct
13 Correct 211 ms 14160 KB Output is correct
14 Correct 215 ms 14296 KB Output is correct
15 Correct 240 ms 14288 KB Output is correct
16 Correct 227 ms 14236 KB Output is correct
17 Correct 222 ms 14536 KB Output is correct
18 Correct 268 ms 14496 KB Output is correct
19 Correct 237 ms 14044 KB Output is correct
20 Correct 253 ms 14428 KB Output is correct
21 Correct 268 ms 14400 KB Output is correct
22 Correct 241 ms 14184 KB Output is correct
23 Correct 246 ms 14332 KB Output is correct
24 Correct 220 ms 14252 KB Output is correct
25 Correct 267 ms 14372 KB Output is correct
26 Correct 227 ms 14376 KB Output is correct
27 Correct 228 ms 14456 KB Output is correct
28 Correct 248 ms 14320 KB Output is correct
29 Correct 222 ms 14536 KB Output is correct
30 Correct 230 ms 14516 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Incorrect 1 ms 212 KB Output isn't correct
42 Halted 0 ms 0 KB -