oj.uz

답안 #336560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336560 2020-12-15T17:04:20 Z super_j6 Feast (NOI19_feast) C++14
12 / 100
 114 ms 7532 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, ll>
#define f first
#define s second

const int mxn = 300001;
int n, k;
ll a[mxn];
pi dp[mxn];

pi sol(ll x){
	pi p = dp[0];
	for(int i = 1; i <= n; i++){
		dp[i] = dp[i - 1];
		if(p.f + a[i] - x >= dp[i].f) dp[i] = {p.f + a[i] - x, p.s + 1};
		if(dp[i].f - a[i] >= p.f) p = {dp[i].f - a[i], dp[i].s};
	}
	return dp[n];
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	
	for(int i = 1; i <= n; i++) cin >> a[i], a[i] += a[i - 1];
	
	ll l = -1, r = 0x3f3f3f3f;
	while(r - l > 1){
		ll mid = (l + r) / 2;
		if(sol(mid).s <= k) r = mid; 
		else l = mid;
	}
	
	pi p = sol(r);
	
	cout << (p.f + p.s * r) << endl;

	return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 7148 KB Output is correct
2 Correct 59 ms 7404 KB Output is correct
3 Correct 61 ms 7436 KB Output is correct
4 Correct 59 ms 7276 KB Output is correct
5 Correct 59 ms 7276 KB Output is correct
6 Correct 61 ms 7148 KB Output is correct
7 Correct 58 ms 7148 KB Output is correct
8 Correct 59 ms 7276 KB Output is correct
9 Correct 59 ms 7148 KB Output is correct
10 Correct 59 ms 7276 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 7148 KB Output is correct
2 Correct 53 ms 7532 KB Output is correct
3 Correct 48 ms 7148 KB Output is correct
4 Correct 51 ms 7276 KB Output is correct
5 Correct 59 ms 7148 KB Output is correct
6 Correct 47 ms 7148 KB Output is correct
7 Correct 51 ms 7404 KB Output is correct
8 Correct 59 ms 7276 KB Output is correct
9 Correct 58 ms 7148 KB Output is correct
10 Correct 52 ms 7276 KB Output is correct

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 114 ms 7296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 7148 KB Output is correct
2 Correct 59 ms 7404 KB Output is correct
3 Correct 61 ms 7436 KB Output is correct
4 Correct 59 ms 7276 KB Output is correct
5 Correct 59 ms 7276 KB Output is correct
6 Correct 61 ms 7148 KB Output is correct
7 Correct 58 ms 7148 KB Output is correct
8 Correct 59 ms 7276 KB Output is correct
9 Correct 59 ms 7148 KB Output is correct
10 Correct 59 ms 7276 KB Output is correct
11 Correct 50 ms 7148 KB Output is correct
12 Correct 53 ms 7532 KB Output is correct
13 Correct 48 ms 7148 KB Output is correct
14 Correct 51 ms 7276 KB Output is correct
15 Correct 59 ms 7148 KB Output is correct
16 Correct 47 ms 7148 KB Output is correct
17 Correct 51 ms 7404 KB Output is correct
18 Correct 59 ms 7276 KB Output is correct
19 Correct 58 ms 7148 KB Output is correct
20 Correct 52 ms 7276 KB Output is correct
21 Incorrect 114 ms 7296 KB Output isn't correct
22 Halted 0 ms 0 KB -