oj.uz

Submission #491669

# Submission time Handle Problem Language Result Execution time Memory
491669 2021-12-03T18:37:04 Z valerikk Climbers (RMI18_climbers) C++17
40 / 100
 800 ms 196412 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = int64_t;
using ull = uint64_t;

const int N = 5007;
const ull INF = numeric_limits<ull>::max();

int n;
ull h[N];
ull d[N][N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> h[i];
	}
	
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n - 1; ++j) {
			d[i][j] = INF;
		}
	}

	priority_queue<pair<ull, pair<int, int>>, vector<pair<ull, pair<int, int>>>, greater<pair<ull, pair<int, int>>>> q;
	
	auto upd = [&](int i, int j, ull dd) {
		if (dd < d[i][j]) {
			d[i][j] = dd;
			q.push({dd, {i, j}});
		}
	};

	upd(0, n - 2, 0);

	while (!q.empty()) {
		auto z = q.top();
		q.pop();

		auto [i, j] = z.second;
	
		if (d[i][j] != z.first) {
			continue;
		}

		if (i == j || i - 1 == j) {
			cout << d[i][j] << endl;
			return 0;
		}

		if (h[i] == h[j]) {
			if (j > 0) {
				upd(i, j - 1, d[i][j]);
			}
			upd(j, i, d[i][j]);
		}

		if (h[i] == h[j + 1]) {
			if (j < n - 1) {
				upd(i, j + 1, d[i][j]);
			}
			upd(j + 1, i, d[i][j]);
		}

		for (int ii : {i - 1, i + 1}) {
			if (ii < 0 || n <= ii) {
				continue;
			}

			if (h[i] < h[ii]) {
				if (h[i] < h[j]) {
					if (h[ii] - h[i] <= h[j] - h[i]) {
						upd(ii, j, d[i][j] + h[ii] - h[i]);
					} else {
						upd(j, min(ii, i), d[i][j] + h[j] - h[i]);
					}
				} else {
					if (h[ii] - h[i] <= h[j + 1] - h[i]) {
						upd(ii, j, d[i][j] + h[ii] - h[i]);
					} else {
						upd(j + 1, min(ii, i), d[i][j] + h[j + 1] - h[i]);
					}
				}
			}

			if (h[i] > h[ii]) {
				if (h[i] > h[j]) {
					if (-h[ii] + h[i] <= -h[j] + h[i]) {
						upd(ii, j, d[i][j] - h[ii] + h[i]);
					} else {
						upd(j, min(ii, i), d[i][j] - h[j] + h[i]);
					}
				} else {
					if (-h[ii] + h[i] <= -h[j + 1] + h[i]) {
						upd(ii, j, d[i][j] - h[ii] + h[i]);
					} else {
						upd(j + 1, min(ii, i), d[i][j] - h[j + 1] + h[i]);
					}
				}
			}	
		}
	}

	cout << "NO" << endl;
	return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 716 KB Output is correct
2 Correct 1 ms 2124 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 44 ms 82776 KB Output is correct
5 Correct 94 ms 196248 KB Output is correct

Subtask #2
15.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 588 KB Output is correct
3 Incorrect 1 ms 1100 KB Output isn't correct
4 Correct 1 ms 720 KB Output is correct
5 Incorrect 2 ms 3148 KB Output isn't correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 716 KB Output isn't correct
2 Incorrect 2 ms 2124 KB Output isn't correct
3 Incorrect 80 ms 12228 KB Output isn't correct
4 Incorrect 182 ms 82852 KB Output isn't correct
5 Incorrect 535 ms 83056 KB Output isn't correct
6 Incorrect 169 ms 141636 KB Output isn't correct
7 Incorrect 639 ms 141640 KB Output isn't correct
8 Incorrect 222 ms 196292 KB Output isn't correct
9 Incorrect 671 ms 196396 KB Output isn't correct
10 Execution timed out 1102 ms 196412 KB Time limit exceeded