oj.uz

Submission #770304

# Submission time Handle Problem Language Result Execution time Memory
770304 2023-07-01T05:19:54 Z Gabi88 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
0 / 100
 1 ms 332 KB 
#include<bits/stdc++.h>
using namespace std;

#define LL long long
#define U unsigned
#define F first
#define S second
#define PB push_back
#define FR front
#define B back
#define P push
#define C const

int n, l[200009], poc = 0, kraj, sum = 0;

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; kraj = n+1;
	for(int i=1; i<=n; i++) cin >> l[i];
	l[0] = 0; l[kraj] = 0;
	while(poc < kraj){
		while(l[poc] < l[poc+1]) poc++;
		while(l[kraj] < l[kraj-1]) kraj--;
		if (poc >= kraj) break;
		sum += max(l[poc]-l[poc+1]+1, l[kraj-1]-l[kraj]+1); poc++; kraj--;
	}
	cout << sum; return 0;
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -