oj.uz

Submission #305087

# Submission time Handle Problem Language Result Execution time Memory
305087 2020-09-22T14:45:43 Z luciocf Feast (NOI19_feast) C++14
30 / 100
 156 ms 8696 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 = -inf;
 
	while (ini <= fim)
	{
		ll mid = (ini+fim)/2ll;
 
		if (qtd(mid) == k)
		{
			best = mid;
			break;
		}

		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

# Verdict Execution time Memory Grader output
1 Correct 145 ms 8440 KB Output is correct
2 Correct 145 ms 8440 KB Output is correct
3 Correct 150 ms 8568 KB Output is correct
4 Correct 147 ms 8440 KB Output is correct
5 Correct 146 ms 8440 KB Output is correct
6 Correct 146 ms 8340 KB Output is correct
7 Correct 143 ms 8312 KB Output is correct
8 Correct 156 ms 8440 KB Output is correct
9 Correct 142 ms 8312 KB Output is correct
10 Correct 145 ms 8444 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 8392 KB Output is correct
2 Correct 87 ms 8568 KB Output is correct
3 Correct 90 ms 8312 KB Output is correct
4 Correct 132 ms 8456 KB Output is correct
5 Correct 64 ms 8316 KB Output is correct
6 Correct 84 ms 8312 KB Output is correct
7 Correct 137 ms 8696 KB Output is correct
8 Correct 67 ms 8440 KB Output is correct
9 Correct 63 ms 8312 KB Output is correct
10 Correct 137 ms 8532 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 8440 KB Output is correct
2 Correct 125 ms 8312 KB Output is correct
3 Correct 116 ms 8440 KB Output is correct
4 Correct 115 ms 8312 KB Output is correct
5 Correct 116 ms 8440 KB Output is correct
6 Correct 120 ms 8568 KB Output is correct
7 Correct 129 ms 8440 KB Output is correct
8 Correct 118 ms 8472 KB Output is correct
9 Correct 117 ms 8696 KB Output is correct
10 Correct 124 ms 8440 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 8440 KB Output is correct
2 Correct 145 ms 8440 KB Output is correct
3 Correct 150 ms 8568 KB Output is correct
4 Correct 147 ms 8440 KB Output is correct
5 Correct 146 ms 8440 KB Output is correct
6 Correct 146 ms 8340 KB Output is correct
7 Correct 143 ms 8312 KB Output is correct
8 Correct 156 ms 8440 KB Output is correct
9 Correct 142 ms 8312 KB Output is correct
10 Correct 145 ms 8444 KB Output is correct
11 Correct 101 ms 8392 KB Output is correct
12 Correct 87 ms 8568 KB Output is correct
13 Correct 90 ms 8312 KB Output is correct
14 Correct 132 ms 8456 KB Output is correct
15 Correct 64 ms 8316 KB Output is correct
16 Correct 84 ms 8312 KB Output is correct
17 Correct 137 ms 8696 KB Output is correct
18 Correct 67 ms 8440 KB Output is correct
19 Correct 63 ms 8312 KB Output is correct
20 Correct 137 ms 8532 KB Output is correct
21 Correct 117 ms 8440 KB Output is correct
22 Correct 125 ms 8312 KB Output is correct
23 Correct 116 ms 8440 KB Output is correct
24 Correct 115 ms 8312 KB Output is correct
25 Correct 116 ms 8440 KB Output is correct
26 Correct 120 ms 8568 KB Output is correct
27 Correct 129 ms 8440 KB Output is correct
28 Correct 118 ms 8472 KB Output is correct
29 Correct 117 ms 8696 KB Output is correct
30 Correct 124 ms 8440 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Incorrect 0 ms 384 KB Output isn't correct
33 Halted 0 ms 0 KB -