Submission #416162

# Submission time Handle Problem Language Result Execution time Memory
416162 2021-06-02T05:57:21 Z alishahali1382 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
34 ms 8532 KB
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

ll n, m, k, u, v, x, y, t, a, b, ans;
ll A[MAXN], B[MAXN];
ll ps[MAXN][2];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=n; i++) cin>>A[i];
	for (int i=1; i<n; i++){
		B[i]=A[i+1]-A[i];
		ps[i][0]=ps[i-1][0];
		ps[i][1]=ps[i-1][1];
		if (B[i]<=0) ps[i][0]+=-B[i]+1;
		if (B[i]>=0) ps[i][1]+=B[i]+1;
	}
	ans=INF;
	for (int k=1; k<=n; k++){
		ll x=ps[k-1][0];
		ll y=ps[n-1][1]-ps[k-1][1];
//		debug2(x, y)
		ans=min(ans, max(x, y));
	}
	cout<<ans<<"\n";
	
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 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 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 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 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 29 ms 8508 KB Output is correct
27 Correct 29 ms 8440 KB Output is correct
28 Correct 29 ms 8440 KB Output is correct
29 Correct 34 ms 8516 KB Output is correct
30 Correct 26 ms 7832 KB Output is correct
31 Correct 29 ms 8456 KB Output is correct
32 Correct 31 ms 8460 KB Output is correct
33 Correct 32 ms 8484 KB Output is correct
34 Correct 29 ms 8532 KB Output is correct
35 Correct 23 ms 7700 KB Output is correct
36 Correct 24 ms 7752 KB Output is correct
37 Correct 24 ms 7828 KB Output is correct
38 Correct 31 ms 8400 KB Output is correct
39 Correct 29 ms 8516 KB Output is correct
40 Correct 28 ms 8520 KB Output is correct
41 Correct 29 ms 8440 KB Output is correct
42 Correct 28 ms 8284 KB Output is correct
43 Correct 28 ms 8468 KB Output is correct
44 Correct 30 ms 8416 KB Output is correct
45 Correct 28 ms 8436 KB Output is correct
46 Correct 30 ms 8432 KB Output is correct
47 Correct 28 ms 8456 KB Output is correct
48 Correct 29 ms 8408 KB Output is correct