oj.uz

Submission #250443

# Submission time Handle Problem Language Result Execution time Memory
250443 2020-07-17T22:33:27 Z tutis Candies (JOI18_candies) C++17
100 / 100
 500 ms 17680 KB 
/*input
5
3 5 1 7 6
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
vector<ll> sum(const vector<ll>&a, const vector<ll>&b)
{
	vector<ll>c((int)a.size() + (int)b.size() - 1, -1e15);
	int x = 0;
	for (int i = 0; i < (int)c.size(); i++)
	{
		int lo = max(0, i - (int)b.size() + 1);
		int hi = min((int)a.size() - 1, i);
		x = max(x, lo);
		x = min(x, hi);
		while (x < hi && a[x + 1] + b[i - x - 1] > a[x] + b[i - x])
			x++;
		c[i] = a[x] + b[i - x];
	}
	return c;
}
vector<array<array<ll, 2>, 2>>ans(const vector<ll> &a)
{
	assert(!a.empty());
	if (a.size() == 1)
	{
		vector<array<array<ll, 2>, 2>>ret(2);
		ret[1][1][1] = a[0];
		ret[0][1][1] = 0;
		ret[0][1][0] = 0;
		ret[0][0][1] = 0;
		ret[0][0][0] = 0;
		ret[1][1][0] = -1e15;
		ret[1][0][1] = -1e15;
		ret[1][0][0] = -1e15;
		return ret;
	}
	if (a.size() == 2)
	{
		vector<array<array<ll, 2>, 2>>ret(2);
		ret[1][1][1] = max(a[0], a[1]);
		ret[1][1][0] = a[0];
		ret[1][0][1] = a[1];
		ret[1][0][0] = -1e15;
		ret[0][1][1] = 0;
		ret[0][1][0] = 0;
		ret[0][0][1] = 0;
		ret[0][0][0] = 0;
		return ret;
	}
	int i = (a.size()) / 2;
	ll xxx = a[i];
	vector<ll>k;
	vector<ll>d;
	for (int j = 0; j < i; j++)
		k.push_back(a[j]);
	for (int j = i + 1; j < (int)a.size(); j++)
		d.push_back(a[j]);
	auto K = ans(k);
	auto D = ans(d);
	vector<array<array<ll, 2>, 2>>ret(((int)a.size() + 3) / 2);
	for (int i = 0; i < (int)ret.size(); i++)
	{
		for (int x : {0, 1})
		{
			for (int y : {0, 1})
			{
				ret[i][x][y] = -1e15;
			}
		}
	}
	vector<ll>suma[2][2][2];
	for (int x : {0, 1})
	{
		for (int t : {0, 1})
			for (int y : {0, 1})
			{
				vector<ll>a;
				vector<ll>b;
				for (int i = 0; i < (int)K.size(); i++)
					a.push_back(K[i][x][t]);
				for (int i = 0; i < (int)D.size(); i++)
					b.push_back(D[i][t][y]);
				suma[x][t][y] = sum(a, b);
			}
	}
	for (int x : {0, 1})
	{
		for (int y : {0, 1})
		{
			for (int i = 0; i < (int)suma[x][1][y].size(); i++)
				ret[i][x][y] = max(ret[i][x][y], suma[x][1][y][i]);
			for (int i = 0; i < (int)suma[x][0][y].size() && i + 1 < ret.size(); i++)
				ret[i + 1][x][y] = max(ret[i + 1][x][y], xxx + suma[x][0][y][i]);
		}
	}
	for (int i = 0; i < ret.size(); i++)
	{
		ret[i][0][1] = max(ret[i][0][1], ret[i][0][0]);
		ret[i][1][0] = max(ret[i][1][0], ret[i][0][0]);
		ret[i][1][1] = max({ret[i][1][1], ret[i][0][1], ret[i][1][0]});
	}
	return ret;
};
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	vector<ll>a(n);
	for (ll&i : a)
		cin >> i;
	vector<array<array<ll, 2>, 2>>x = ans(a);
	for (int i = 1; i <= (n + 1) / 2; i++)
	{
		cout << x[i][1][1] << "\n";
	}
	return 0;
}

Compilation message

candies.cpp: In function 'std::vector<std::array<std::array<long long int, 2>, 2> > ans(const std::vector<long long int>&)':
candies.cpp:96:59: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < (int)suma[x][0][y].size() && i + 1 < ret.size(); i++)
                                                     ~~~~~~^~~~~~~~~~~~
candies.cpp:100:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ret.size(); i++)
                  ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 8 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 8 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 8 ms 512 KB Output is correct
18 Correct 8 ms 512 KB Output is correct
19 Correct 8 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 488 ms 17340 KB Output is correct
22 Correct 500 ms 17328 KB Output is correct
23 Correct 498 ms 17624 KB Output is correct
24 Correct 447 ms 17512 KB Output is correct
25 Correct 451 ms 17472 KB Output is correct
26 Correct 446 ms 17676 KB Output is correct
27 Correct 449 ms 17604 KB Output is correct
28 Correct 456 ms 17344 KB Output is correct
29 Correct 453 ms 17452 KB Output is correct
30 Correct 456 ms 17484 KB Output is correct
31 Correct 463 ms 17336 KB Output is correct
32 Correct 463 ms 17488 KB Output is correct
33 Correct 469 ms 17528 KB Output is correct
34 Correct 462 ms 17388 KB Output is correct
35 Correct 460 ms 17480 KB Output is correct
36 Correct 489 ms 17468 KB Output is correct
37 Correct 483 ms 17340 KB Output is correct
38 Correct 492 ms 17468 KB Output is correct
39 Correct 447 ms 17680 KB Output is correct
40 Correct 450 ms 17640 KB Output is correct
41 Correct 450 ms 17548 KB Output is correct
42 Correct 461 ms 17328 KB Output is correct
43 Correct 475 ms 17504 KB Output is correct
44 Correct 456 ms 17484 KB Output is correct
45 Correct 454 ms 17504 KB Output is correct
46 Correct 452 ms 17308 KB Output is correct
47 Correct 465 ms 17380 KB Output is correct
48 Correct 480 ms 17644 KB Output is correct
49 Correct 459 ms 17480 KB Output is correct
50 Correct 469 ms 17468 KB Output is correct