oj.uz

Submission #305075

# Submission time Handle Problem Language Result Execution time Memory
305075 2020-09-22T14:13:39 Z luciocf Feast (NOI19_feast) C++14
4 / 100
 205 ms 8568 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 = 6e12+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++)
	{
		if (dp[i-1].ff - pref[i-1] > mx.ff)
			mx = {dp[i-1].ff - pref[i-1], dp[i-1].ss};

		dp[i] = dp[i-1];

		if (pref[i] + mx.ff + c > dp[i].ff)
			dp[i] = {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) fim = mid-1;
		else 
		{
			best = mid;

			if (qtd(mid) == k) fim = mid-1;
			else 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:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |  scanf("%d %d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~
feast.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 8440 KB Output is correct
2 Correct 116 ms 8440 KB Output is correct
3 Correct 119 ms 8568 KB Output is correct
4 Correct 127 ms 8568 KB Output is correct
5 Correct 119 ms 8568 KB Output is correct
6 Correct 113 ms 8312 KB Output is correct
7 Correct 120 ms 8312 KB Output is correct
8 Correct 117 ms 8508 KB Output is correct
9 Correct 114 ms 8440 KB Output is correct
10 Correct 116 ms 8440 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 8440 KB Output is correct
2 Correct 116 ms 8440 KB Output is correct
3 Correct 119 ms 8568 KB Output is correct
4 Correct 127 ms 8568 KB Output is correct
5 Correct 119 ms 8568 KB Output is correct
6 Correct 113 ms 8312 KB Output is correct
7 Correct 120 ms 8312 KB Output is correct
8 Correct 117 ms 8508 KB Output is correct
9 Correct 114 ms 8440 KB Output is correct
10 Correct 116 ms 8440 KB Output is correct
11 Incorrect 111 ms 8312 KB Output isn't correct
12 Halted 0 ms 0 KB -