Submission #364855

# Submission time Handle Problem Language Result Execution time Memory
364855 2021-02-10T09:28:13 Z Rainbowbunny Divide and conquer (IZhO14_divide) C++17
100 / 100
44 ms 6380 KB
#include <iostream>

int n;
long long ans = 0;
long long x[100005], g[100005], d[100005];
long long suffix[100005];

int main()
{
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);
	std::cin >> n;
	for(int i = 1; i <= n; i++)
	{
		std::cin >> x[i] >> g[i] >> d[i];
		d[i] += d[i - 1];
		g[i] += g[i - 1];
	}
	suffix[n] = d[n] - x[n];
	for(int i = n - 1; i >= 1; i--)
	{
		suffix[i] = std::max(suffix[i + 1], d[i] - x[i]);
	}
	for(int i = 1; i <= n; i++)
	{
		long long value = d[i - 1] - x[i];
		int l = 1, r = n;
		while(l < r)
		{
			int mid = (l + r + 1) >> 1;
			if(suffix[mid] >= value)
			{
				l = mid;
			}
			else
			{
				r = mid - 1;
			}
		}
		ans = std::max(ans, g[l] - g[i - 1]);
	}
	std::cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 3 ms 620 KB Output is correct
24 Correct 3 ms 620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 3 ms 620 KB Output is correct
24 Correct 3 ms 620 KB Output is correct
25 Correct 2 ms 620 KB Output is correct
26 Correct 3 ms 748 KB Output is correct
27 Correct 4 ms 876 KB Output is correct
28 Correct 19 ms 2944 KB Output is correct
29 Correct 20 ms 3180 KB Output is correct
30 Correct 39 ms 6380 KB Output is correct
31 Correct 40 ms 5228 KB Output is correct
32 Correct 40 ms 5376 KB Output is correct
33 Correct 32 ms 5100 KB Output is correct
34 Correct 35 ms 5100 KB Output is correct
35 Correct 39 ms 5612 KB Output is correct
36 Correct 44 ms 5740 KB Output is correct