oj.uz

답안 #305064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305064 2020-09-22T13:56:08 Z luciocf Feast (NOI19_feast) C++14
30 / 100
 147 ms 8572 KB 
#include <bits/stdc++.h>

#define ff first
#define ss second

using namespace std;

typedef long long ll;
typedef pair<ll, int> pii;

const int maxn = 3e5+10;
const ll inf = 6e14+10;

int n;
int a[maxn];

ll pref[maxn];

pii dp[maxn];

int qtd(ll c)
{	
	pii mx = {0, 0};

	for (int i = 1; i <= n; i++)
	{
		mx = max(mx, {dp[i-1].ff - pref[i-1], dp[i-1].ss});

		dp[i] = max(dp[i-1], {pref[i] + mx.ff + c, mx.ss+1});
	}

	return dp[n].ss;
}

int main(void)
{
	int k;
	scanf("%d %d", &n, &k);

	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);

		pref[i] = pref[i-1]+1ll*a[i];
	}

	ll ini = -inf, fim = inf, best = -1;

	while (ini <= fim)
	{
		ll mid = (ini+fim)/2ll;

		if (qtd(mid) > k) fim = mid-1;
		else best = mid, ini = mid+1;
	}

	qtd(best);

	printf("%lld\n", dp[n].ff - 1ll*dp[n].ss*best);
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |  scanf("%d %d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~
feast.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 8312 KB Output is correct
2 Correct 110 ms 8568 KB Output is correct
3 Correct 115 ms 8568 KB Output is correct
4 Correct 107 ms 8480 KB Output is correct
5 Correct 108 ms 8440 KB Output is correct
6 Correct 104 ms 8312 KB Output is correct
7 Correct 106 ms 8440 KB Output is correct
8 Correct 108 ms 8440 KB Output is correct
9 Correct 108 ms 8316 KB Output is correct
10 Correct 106 ms 8440 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 8568 KB Output is correct
2 Correct 93 ms 8568 KB Output is correct
3 Correct 93 ms 8444 KB Output is correct
4 Correct 90 ms 8440 KB Output is correct
5 Correct 104 ms 8312 KB Output is correct
6 Correct 90 ms 8312 KB Output is correct
7 Correct 93 ms 8568 KB Output is correct
8 Correct 107 ms 8528 KB Output is correct
9 Correct 105 ms 8316 KB Output is correct
10 Correct 93 ms 8440 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 8440 KB Output is correct
2 Correct 140 ms 8312 KB Output is correct
3 Correct 146 ms 8572 KB Output is correct
4 Correct 139 ms 8312 KB Output is correct
5 Correct 137 ms 8440 KB Output is correct
6 Correct 140 ms 8440 KB Output is correct
7 Correct 144 ms 8444 KB Output is correct
8 Correct 143 ms 8440 KB Output is correct
9 Correct 146 ms 8568 KB Output is correct
10 Correct 144 ms 8572 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 8312 KB Output is correct
2 Correct 110 ms 8568 KB Output is correct
3 Correct 115 ms 8568 KB Output is correct
4 Correct 107 ms 8480 KB Output is correct
5 Correct 108 ms 8440 KB Output is correct
6 Correct 104 ms 8312 KB Output is correct
7 Correct 106 ms 8440 KB Output is correct
8 Correct 108 ms 8440 KB Output is correct
9 Correct 108 ms 8316 KB Output is correct
10 Correct 106 ms 8440 KB Output is correct
11 Correct 95 ms 8568 KB Output is correct
12 Correct 93 ms 8568 KB Output is correct
13 Correct 93 ms 8444 KB Output is correct
14 Correct 90 ms 8440 KB Output is correct
15 Correct 104 ms 8312 KB Output is correct
16 Correct 90 ms 8312 KB Output is correct
17 Correct 93 ms 8568 KB Output is correct
18 Correct 107 ms 8528 KB Output is correct
19 Correct 105 ms 8316 KB Output is correct
20 Correct 93 ms 8440 KB Output is correct
21 Correct 147 ms 8440 KB Output is correct
22 Correct 140 ms 8312 KB Output is correct
23 Correct 146 ms 8572 KB Output is correct
24 Correct 139 ms 8312 KB Output is correct
25 Correct 137 ms 8440 KB Output is correct
26 Correct 140 ms 8440 KB Output is correct
27 Correct 144 ms 8444 KB Output is correct
28 Correct 143 ms 8440 KB Output is correct
29 Correct 146 ms 8568 KB Output is correct
30 Correct 144 ms 8572 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Incorrect 1 ms 384 KB Output isn't correct
33 Halted 0 ms 0 KB -