oj.uz

Submission #968273

# Submission time Handle Problem Language Result Execution time Memory
968273 2024-04-23T09:13:06 Z Gromp15 Real Mountains (CCO23_day1problem2) C++17
10 / 25
 5000 ms 21444 KB 
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
const int mod = 1000003;
void test_case() {
	int n; cin >> n;
	vector<int> h(n);
	int mx = 0;
	for (int &x : h) cin >> x, ckmax(mx, x);
	vector<int> f(h);
	{
		int l = -1, r = -1;
		for (int i = 0; i < n; i++) if (h[i] == mx) {
			if (!~l) l = i;
			r = i;
		}
		for (int i = l; i <= r; i++) f[i] = mx;
		for (int i = 1; i < l; i++) ckmax(f[i], f[i-1]);
		for (int i = n-2; i > r; i--) ckmax(f[i], f[i+1]);
	}
	int ans = 0;
	const int INF = 1e9;
	for (int t = 1; t < mx; t++) {
		vector<int> pref(n), suff(n);
		for (int i = 0; i < n; i++) {
			pref[i] = min(h[i] > t ? h[i] : INF, i ? pref[i-1] : INF);
		}
		for (int i = n-1; i >= 0; i--) {
			suff[i] = min(h[i] > t ? h[i] : INF, i + 1 < n ? suff[i+1] : INF);
		}
		int L = -1, R = -1, bet = 0;
		for (int i = 0; i < n; i++) if (h[i] == t && h[i] < f[i]) {
			if (!~L) L = i;
			R = i;
			bet++;
		}
		if (!~L) continue;
		if (L == R) {
			ans += (pref[L] + suff[L] + h[L]) % mod;
			h[L]++;
			if (ans >= mod) ans -= mod;
		}
		else {
			if (pref[L] + suff[L] + t + suff[R] + t + 1 + t < pref[R] + suff[R] + t + pref[L] + t + 1 + t) {
				// choose left first
				ans += (pref[L] + suff[L] + h[L]) % mod;
				if (ans >= mod) ans -= mod;
				h[L]++;
				ans += (suff[R] + 2 * t + 1) % mod;
				if (ans >= mod) ans -= mod;
				h[R]++;
			}
			else {
				ans += (pref[R] + suff[R] + h[R]) % mod;
				if (ans >= mod) ans -= mod;
				h[R]++;
				ans += (pref[L] + t + 1 + t) % mod;
				if (ans >= mod) ans -= mod;
				h[L]++;
			}
			ans += (ll)max(bet - 2, 0) * (t + 2 * t + 2) % mod;
			if (ans >= mod) ans -= mod;
			for (int i = 0; i < n; i++) if (h[i] == t && h[i] < f[i]) h[i]++;
		}
	}
	cout << ans << '\n';



}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
//    cin >> t;
    while (t--) test_case();
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 344 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 5 ms 556 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 4 ms 552 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 4 ms 556 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 5 ms 556 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 4 ms 552 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 4 ms 556 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Execution timed out 5047 ms 344 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 5 ms 556 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 4 ms 552 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 4 ms 556 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Execution timed out 5047 ms 344 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 5 ms 556 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 4 ms 552 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 4 ms 556 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1170 ms 19172 KB Output is correct
36 Correct 1141 ms 19196 KB Output is correct
37 Correct 1148 ms 19320 KB Output is correct
38 Correct 1139 ms 19228 KB Output is correct
39 Correct 1197 ms 18976 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 829 ms 18580 KB Output is correct
43 Correct 767 ms 18356 KB Output is correct
44 Correct 771 ms 18192 KB Output is correct
45 Correct 708 ms 19224 KB Output is correct
46 Correct 729 ms 19320 KB Output is correct
47 Correct 772 ms 21444 KB Output is correct
48 Correct 888 ms 21272 KB Output is correct
49 Correct 833 ms 19292 KB Output is correct
50 Correct 878 ms 19324 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 5 ms 556 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 4 ms 552 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 4 ms 556 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Execution timed out 5047 ms 344 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 556 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 5 ms 556 KB Output is correct
18 Correct 5 ms 468 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 4 ms 552 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 4 ms 556 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Execution timed out 5047 ms 344 KB Time limit exceeded
36 Halted 0 ms 0 KB -