Submission #412989

# Submission time Handle Problem Language Result Execution time Memory
412989 2021-05-27T23:54:42 Z joseacaz Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
100 ms 8232 KB
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb push_back

const int MAXN = (int)2e5 + 5;
int N;
ll a[MAXN], l[MAXN], r[MAXN], maxL[MAXN], maxR[MAXN];

int main()
{
	cin >> N;
	for(int i = 1; i <= N; i++)
		cin >> a[i];
	
	for(int i = 1; i <= N; i++)
	{
		ll free = l[i - 1] - a[i - 1];
		l[i] = max(a[i] + free, l[i - 1] + 1);
	}
	for(int i = 1; i <= N; i++)
	{
		l[i] -= a[i];
		maxL[i] = max(maxL[i - 1], l[i]);
	}
	
	for(int i = N; i >= 1; i--)
	{
		ll free = r[i + 1] - a[i + 1];
		r[i] = max(a[i] + free, r[i + 1] + 1);
	}
	for(int i = N; i >= 1; i--)
	{
		r[i] -= a[i];
		maxR[i] = max(maxR[i + 1], r[i]);
	}
	
	ll ans = maxL[N];
	for(int i = 1; i < N; i++)
		if(l[i] + a[i] != r[i + 1] + a[i + 1])
			ans = min(ans, max(maxL[i], maxR[i + 1]));
	cout << ans << "\n";
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 308 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 2 ms 316 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 308 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 2 ms 316 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 336 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 94 ms 8204 KB Output is correct
27 Correct 98 ms 8120 KB Output is correct
28 Correct 100 ms 8184 KB Output is correct
29 Correct 98 ms 8184 KB Output is correct
30 Correct 72 ms 8212 KB Output is correct
31 Correct 95 ms 8132 KB Output is correct
32 Correct 97 ms 8176 KB Output is correct
33 Correct 96 ms 8196 KB Output is correct
34 Correct 100 ms 8156 KB Output is correct
35 Correct 69 ms 8188 KB Output is correct
36 Correct 74 ms 8160 KB Output is correct
37 Correct 72 ms 8184 KB Output is correct
38 Correct 92 ms 8136 KB Output is correct
39 Correct 94 ms 8156 KB Output is correct
40 Correct 98 ms 8176 KB Output is correct
41 Correct 94 ms 8132 KB Output is correct
42 Correct 87 ms 8188 KB Output is correct
43 Correct 99 ms 8196 KB Output is correct
44 Correct 98 ms 8144 KB Output is correct
45 Correct 94 ms 8180 KB Output is correct
46 Correct 94 ms 8232 KB Output is correct
47 Correct 95 ms 8108 KB Output is correct
48 Correct 94 ms 8188 KB Output is correct