Submission #445241

# Submission time Handle Problem Language Result Execution time Memory
445241 2021-07-17T04:30:40 Z maomao90 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
33 ms 6224 KB
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifdef DEBUG
#define debug(args...) _debug(args)
void _debug(const char* format, ...) {
	va_list args;
	va_start(args, format);
	vprintf(format, args);
	va_end(args);
}
#else
#define debug(args...)
#endif

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 200005

int n;
int a[MAXN];
ll psum[MAXN], nsum[MAXN];

int main() {
	scanf("%d", &n);
	REP (i, 1, n + 1) {
		scanf("%d", &a[i]);
		int diff = a[i] - a[i - 1];
		psum[i] = psum[i - 1];
		nsum[i] = nsum[i - 1];
		if (diff >= 0) {
			psum[i] += diff + 1;
		} 
		if (diff <= 0) {
			nsum[i] -= diff - 1;
		}
		debug("%d: %d\n", i, diff);
	}
	ll ans = LINF;
	REP (i, 1, n + 1) {
		ll l = nsum[i], r = psum[n] - psum[i];
		debug("%d: %lld %lld\n", i, l, r);
		mnto(ans, max(l, r));
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
Main.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 332 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 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 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 332 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 32 ms 6012 KB Output is correct
27 Correct 33 ms 6056 KB Output is correct
28 Correct 30 ms 6084 KB Output is correct
29 Correct 31 ms 6224 KB Output is correct
30 Correct 26 ms 5432 KB Output is correct
31 Correct 30 ms 6052 KB Output is correct
32 Correct 30 ms 6084 KB Output is correct
33 Correct 30 ms 6036 KB Output is correct
34 Correct 30 ms 6092 KB Output is correct
35 Correct 24 ms 5320 KB Output is correct
36 Correct 25 ms 5448 KB Output is correct
37 Correct 25 ms 5452 KB Output is correct
38 Correct 29 ms 6092 KB Output is correct
39 Correct 30 ms 6104 KB Output is correct
40 Correct 30 ms 6076 KB Output is correct
41 Correct 30 ms 6008 KB Output is correct
42 Correct 28 ms 5828 KB Output is correct
43 Correct 30 ms 6056 KB Output is correct
44 Correct 29 ms 6084 KB Output is correct
45 Correct 30 ms 6040 KB Output is correct
46 Correct 33 ms 6120 KB Output is correct
47 Correct 30 ms 6084 KB Output is correct
48 Correct 30 ms 6152 KB Output is correct