oj.uz

Submission #305053

# Submission time Handle Problem Language Result Execution time Memory
305053 2020-09-22T13:28:32 Z luciocf Feast (NOI19_feast) C++14
59 / 100
 146 ms 8576 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 = 1e13+10;

int n;
int a[maxn];

ll pref[maxn];

pii dp[maxn];

int qtd(ll c)
{
	memset(dp, 0, sizeof dp);
	
	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 = 0, best = -inf;

	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*k*best);
}

Compilation message

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

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 109 ms 8440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 8444 KB Output is correct
2 Correct 100 ms 8576 KB Output is correct
3 Correct 98 ms 8440 KB Output is correct
4 Incorrect 104 ms 8440 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.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 145 ms 8440 KB Output is correct
4 Correct 142 ms 8568 KB Output is correct
5 Correct 141 ms 8440 KB Output is correct
6 Correct 146 ms 8568 KB Output is correct
7 Correct 143 ms 8568 KB Output is correct
8 Correct 140 ms 8444 KB Output is correct
9 Correct 141 ms 8568 KB Output is correct
10 Correct 144 ms 8568 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4992 KB Output is correct
2 Correct 14 ms 4992 KB Output is correct
3 Correct 14 ms 4992 KB Output is correct
4 Correct 12 ms 4992 KB Output is correct
5 Correct 13 ms 4992 KB Output is correct
6 Correct 13 ms 4992 KB Output is correct
7 Correct 12 ms 4992 KB Output is correct
8 Correct 13 ms 4992 KB Output is correct
9 Correct 13 ms 4992 KB Output is correct
10 Correct 13 ms 4992 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4992 KB Output is correct
2 Correct 14 ms 4992 KB Output is correct
3 Correct 14 ms 4992 KB Output is correct
4 Correct 12 ms 4992 KB Output is correct
5 Correct 13 ms 4992 KB Output is correct
6 Correct 13 ms 4992 KB Output is correct
7 Correct 12 ms 4992 KB Output is correct
8 Correct 13 ms 4992 KB Output is correct
9 Correct 13 ms 4992 KB Output is correct
10 Correct 13 ms 4992 KB Output is correct
11 Correct 13 ms 4992 KB Output is correct
12 Correct 12 ms 4992 KB Output is correct
13 Correct 14 ms 4992 KB Output is correct
14 Correct 14 ms 4992 KB Output is correct
15 Correct 13 ms 4992 KB Output is correct
16 Correct 12 ms 4992 KB Output is correct
17 Correct 13 ms 4992 KB Output is correct
18 Correct 13 ms 4992 KB Output is correct
19 Correct 14 ms 4992 KB Output is correct
20 Correct 14 ms 5120 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4992 KB Output is correct
2 Correct 14 ms 4992 KB Output is correct
3 Correct 14 ms 4992 KB Output is correct
4 Correct 12 ms 4992 KB Output is correct
5 Correct 13 ms 4992 KB Output is correct
6 Correct 13 ms 4992 KB Output is correct
7 Correct 12 ms 4992 KB Output is correct
8 Correct 13 ms 4992 KB Output is correct
9 Correct 13 ms 4992 KB Output is correct
10 Correct 13 ms 4992 KB Output is correct
11 Correct 13 ms 4992 KB Output is correct
12 Correct 12 ms 4992 KB Output is correct
13 Correct 14 ms 4992 KB Output is correct
14 Correct 14 ms 4992 KB Output is correct
15 Correct 13 ms 4992 KB Output is correct
16 Correct 12 ms 4992 KB Output is correct
17 Correct 13 ms 4992 KB Output is correct
18 Correct 13 ms 4992 KB Output is correct
19 Correct 14 ms 4992 KB Output is correct
20 Correct 14 ms 5120 KB Output is correct
21 Correct 13 ms 5024 KB Output is correct
22 Correct 13 ms 4992 KB Output is correct
23 Correct 14 ms 4992 KB Output is correct
24 Correct 14 ms 4992 KB Output is correct
25 Correct 13 ms 4992 KB Output is correct
26 Correct 14 ms 4992 KB Output is correct
27 Correct 14 ms 4992 KB Output is correct
28 Correct 14 ms 5120 KB Output is correct
29 Correct 13 ms 4992 KB Output is correct
30 Correct 13 ms 4992 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 109 ms 8440 KB Output isn't correct
2 Halted 0 ms 0 KB -