oj.uz

답안 #817418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817418 2023-08-09T12:22:17 Z vjudge1 Feast (NOI19_feast) C++17
40 / 100
 248 ms 14616 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;
	ii final = {(int)-1e18, 0LL};
	while (l <= r){
		int mid = (l + r) >> 1;
		auto res = f(mid);
		if (res.second <= k){
			r = mid - 1;
			final = res;
		}
		else l = mid + 1;
	}

	cout << final.first + l * final.second << "\n";
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 219 ms 14108 KB Output is correct
2 Correct 216 ms 14352 KB Output is correct
3 Correct 211 ms 14532 KB Output is correct
4 Correct 219 ms 14412 KB Output is correct
5 Correct 219 ms 14352 KB Output is correct
6 Correct 228 ms 14108 KB Output is correct
7 Correct 210 ms 14156 KB Output is correct
8 Correct 209 ms 14380 KB Output is correct
9 Correct 204 ms 14164 KB Output is correct
10 Correct 204 ms 14280 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 14232 KB Output is correct
2 Correct 241 ms 14476 KB Output is correct
3 Correct 187 ms 14200 KB Output is correct
4 Correct 224 ms 14416 KB Output is correct
5 Correct 218 ms 14180 KB Output is correct
6 Correct 205 ms 14124 KB Output is correct
7 Correct 246 ms 14504 KB Output is correct
8 Correct 202 ms 14484 KB Output is correct
9 Correct 201 ms 14088 KB Output is correct
10 Correct 220 ms 14480 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 221 ms 14384 KB Output is correct
2 Correct 215 ms 14184 KB Output is correct
3 Correct 230 ms 14376 KB Output is correct
4 Correct 206 ms 14192 KB Output is correct
5 Correct 206 ms 14400 KB Output is correct
6 Correct 248 ms 14616 KB Output is correct
7 Correct 218 ms 14436 KB Output is correct
8 Correct 216 ms 14392 KB Output is correct
9 Correct 215 ms 14512 KB Output is correct
10 Correct 210 ms 14476 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 0 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 219 ms 14108 KB Output is correct
2 Correct 216 ms 14352 KB Output is correct
3 Correct 211 ms 14532 KB Output is correct
4 Correct 219 ms 14412 KB Output is correct
5 Correct 219 ms 14352 KB Output is correct
6 Correct 228 ms 14108 KB Output is correct
7 Correct 210 ms 14156 KB Output is correct
8 Correct 209 ms 14380 KB Output is correct
9 Correct 204 ms 14164 KB Output is correct
10 Correct 204 ms 14280 KB Output is correct
11 Correct 223 ms 14232 KB Output is correct
12 Correct 241 ms 14476 KB Output is correct
13 Correct 187 ms 14200 KB Output is correct
14 Correct 224 ms 14416 KB Output is correct
15 Correct 218 ms 14180 KB Output is correct
16 Correct 205 ms 14124 KB Output is correct
17 Correct 246 ms 14504 KB Output is correct
18 Correct 202 ms 14484 KB Output is correct
19 Correct 201 ms 14088 KB Output is correct
20 Correct 220 ms 14480 KB Output is correct
21 Correct 221 ms 14384 KB Output is correct
22 Correct 215 ms 14184 KB Output is correct
23 Correct 230 ms 14376 KB Output is correct
24 Correct 206 ms 14192 KB Output is correct
25 Correct 206 ms 14400 KB Output is correct
26 Correct 248 ms 14616 KB Output is correct
27 Correct 218 ms 14436 KB Output is correct
28 Correct 216 ms 14392 KB Output is correct
29 Correct 215 ms 14512 KB Output is correct
30 Correct 210 ms 14476 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 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 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 0 ms 212 KB Output isn't correct
42 Halted 0 ms 0 KB -