oj.uz

Submission #371264

# Submission time Handle Problem Language Result Execution time Memory
371264 2021-02-26T10:12:00 Z arnold518 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
 38 ms 5100 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;
const ll INF = 1e18;

int N;
ll A[MAXN+10];
ll ans=INF;

ll B[MAXN+10], C[MAXN+10];

int main()
{
	scanf("%d", &N);
	for(int i=1; i<=N; i++) scanf("%lld", &A[i]);

	for(int i=2; i<=N; i++)
	{
		B[i]=B[i-1]+max(0ll, A[i-1]+1-A[i]);
	}
	for(int i=N-1; i>=1; i--)
	{
		C[i]=C[i+1]+max(0ll, A[i+1]+1-A[i]);
	}

	ll ans=INF;
	for(int i=1; i<N; i++)
	{
		ll t=max(B[i], C[i+1]);
		if(A[i]+B[i]==A[i+1]+C[i+1]) t++;
		ans=min(ans, t);
	}
	ans=min(ans, B[N]);
	ans=min(ans, C[1]);
	printf("%lld\n", ans);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
Main.cpp:20:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   20 |  for(int i=1; i<=N; i++) scanf("%lld", &A[i]);
      |                          ~~~~~^~~~~~~~~~~~~~~

Subtask #1
40.0 / 40.0

# 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 2 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 364 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 364 KB Output is correct
23 Correct 38 ms 384 KB Output is correct
24 Correct 1 ms 376 KB Output is correct

Subtask #2
60.0 / 60.0

# 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 2 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 364 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 364 KB Output is correct
23 Correct 38 ms 384 KB Output is correct
24 Correct 1 ms 376 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 32 ms 4972 KB Output is correct
27 Correct 34 ms 4972 KB Output is correct
28 Correct 32 ms 5100 KB Output is correct
29 Correct 31 ms 4972 KB Output is correct
30 Correct 30 ms 4972 KB Output is correct
31 Correct 32 ms 4972 KB Output is correct
32 Correct 32 ms 4972 KB Output is correct
33 Correct 31 ms 4972 KB Output is correct
34 Correct 32 ms 4972 KB Output is correct
35 Correct 26 ms 4972 KB Output is correct
36 Correct 27 ms 4972 KB Output is correct
37 Correct 27 ms 4972 KB Output is correct
38 Correct 34 ms 4972 KB Output is correct
39 Correct 31 ms 4972 KB Output is correct
40 Correct 32 ms 5004 KB Output is correct
41 Correct 32 ms 4972 KB Output is correct
42 Correct 30 ms 4972 KB Output is correct
43 Correct 31 ms 4972 KB Output is correct
44 Correct 33 ms 4972 KB Output is correct
45 Correct 32 ms 4972 KB Output is correct
46 Correct 32 ms 4972 KB Output is correct
47 Correct 31 ms 4972 KB Output is correct
48 Correct 32 ms 4972 KB Output is correct