oj.uz

Submission #422793

# Submission time Handle Problem Language Result Execution time Memory
422793 2021-06-10T12:29:51 Z KoD Sky Walking (IOI19_walk) C++17
24 / 100
 4000 ms 1048580 KB 
#include <bits/stdc++.h>
#include "walk.h"

using ll = long long;
template <class T> using Vec = std::vector<T>;
template <class T> using Heap = std::priority_queue<T, Vec<T>, std::greater<T>>;

constexpr ll INF = std::numeric_limits<ll>::max() / 2;

struct RMQ {
	int size;
	Vec<ll> min;
	RMQ(const int n): size(n), min(2 * n, INF) {}
	void assign(int i, const ll x) {
		i += size;
		min[i] = x;
		while (i > 1) {
			i >>= 1;
			min[i] = std::min(min[2 * i], min[2 * i + 1]);
		}
	}
	ll fold(int l, int r) const {
		l += size;
		r += size;
		ll x = INF;
		while (l < r) {
			if (l & 1) x = std::min(x, min[l++]);
			if (r & 1) x = std::min(x, min[--r]);
			l >>= 1;
			r >>= 1;
		}
		return x;
	}
};

ll min_distance(Vec<int> x, Vec<int> h, Vec<int> l, Vec<int> r, Vec<int> y, int s, int g) {
	const int n = (int) x.size();
	const int m = (int) y.size();
	// if (s == 0 and g == n - 1) {
	// 	Vec<Vec<int>> start(n), end(n);
	// 	for (int i = 0; i < m; ++i) {
	// 		start[l[i]].push_back(i);
	// 		end[r[i]].push_back(i);
	// 	}
	// 	Vec<int> cmp = y;
	// 	std::sort(cmp.begin(), cmp.end());
	// 	cmp.erase(std::unique(cmp.begin(), cmp.end()), cmp.end());
	// 	Vec<int> idx(m);
	// 	for (int i = 0; i < m; ++i) {
	// 		idx[i] = std::lower_bound(cmp.begin(), cmp.end(), y[i]) - cmp.begin();
	// 	}
	// 	const int sz = (int) cmp.size();
	// 	RMQ down(sz), up(sz);
	// 	Vec<int> alive(sz);
	// 	for (const int j: start[0]) {
	// 		down.assign(idx[j], y[j] - y[j]);
	// 		up.assign(idx[j], y[j] + y[j]);
	// 		alive[idx[j]] += 1;			
	// 	}
	// 	for (int i = 1; i < n; ++i) {
	// 		const int height = std::upper_bound(cmp.begin(), cmp.end(), h[i]) - cmp.begin();
	// 		for (const auto j: start[i]) {
	// 			const ll a = down.fold(0, idx[j] + 1);
	// 			const ll b = up.fold(idx[j], height);
	// 			ll d = INF;
	// 			if (a != INF) {
	// 				d = std::min(d, a + y[j]);
	// 			}
	// 			if (b != INF) {
	// 				d = std::min(d, b - y[j]);
	// 			}
	// 			if (d != INF) {
	// 				down.assign(idx[j], d - y[j]);
	// 				up.assign(idx[j], d + y[j]);
	// 			} else {
	// 				down.assign(idx[j], INF);
	// 				down.assign(idx[j], INF);
	// 			}
	// 			alive[idx[j]] += 1;
	// 		}
	// 		if (i != n - 1) {
	// 			for (const auto j: end[i]) {
	// 				alive[idx[j]] -= 1;
	// 				if (alive[idx[j]] == 0) {
	// 					down.assign(idx[j], INF);
	// 					up.assign(idx[j], INF);
	// 				}
	// 			}
	// 		}
	// 	}
	// 	ll ret = up.fold(0, sz);
	// 	return ret == INF ? -1 : (ret + x[n - 1] - x[0]);
	// }
	Vec<std::tuple<int, int, int>> query;
	query.reserve(n + m);
	for (int i = 0; i < n; ++i) {
		query.emplace_back(h[i], n, i);
	}
	for (int i = 0; i < m; ++i) {
		query.emplace_back(y[i], l[i], r[i]);
	}
	Vec<Vec<ll>> height(n);
	Vec<Vec<Vec<std::pair<int, int>>>> graph(n);
	std::sort(query.rbegin(), query.rend());
	std::map<int, int> alive;
	for (const auto [t, u, v]: query) {
		if (u == n) {
			alive.emplace(x[v], v);
		} else {
			const auto end = alive.upper_bound(x[v]);
			int li = -1, lj = -1;
			for (auto itr = alive.lower_bound(x[u]); itr != end; ++itr) {
				const auto i = itr -> second;
				if (height[i].empty() or height[i].back() != t) {
					height[i].push_back(t);
					graph[i].emplace_back();
				}
				const auto j = (int) height[i].size() - 1;
				if (li != -1) {
					graph[i][j].emplace_back(li, lj);
					graph[li][lj].emplace_back(i, j);
				}
				li = i, lj = j;
			}
		}
	}
	Vec<Vec<ll>> dist(n);
	for (int i = 0; i < n; ++i) {
		height[i].push_back(0);
		graph[i].emplace_back();
		dist[i].assign(height[i].size(), INF);
	}
	Heap<std::tuple<ll, int, int>> heap;
	const auto push = [&](const int i, const int j, const ll d) {
		if (dist[i][j] > d) {
			dist[i][j] = d;
			heap.emplace(d, i, j);
		}
	};
	push(s, (int) height[s].size() - 1, 0);
	while (!heap.empty()) {
		const auto [d, i, j] = heap.top();
		heap.pop();
		if (dist[i][j] < d) {
			continue;
		}
		for (const auto [ni, nj]: graph[i][j]) {
			push(ni, nj, d + std::abs(x[i] - x[ni]));
		}
		if (j > 0) {
			push(i, j - 1, d + std::abs(height[i][j] - height[i][j - 1]));
		}
		if (j + 1 < (int) height[i].size()) {
			push(i, j + 1, d + std::abs(height[i][j + 1] - height[i][j]));
		}
	}
	const auto ret = dist[g][height[g].size() - 1];
	return ret == INF ? -1 : ret;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 574 ms 67812 KB Output is correct
4 Correct 871 ms 87492 KB Output is correct
5 Correct 576 ms 76724 KB Output is correct
6 Correct 493 ms 69448 KB Output is correct
7 Correct 571 ms 76740 KB Output is correct
8 Correct 755 ms 82424 KB Output is correct
9 Correct 615 ms 71828 KB Output is correct
10 Correct 1171 ms 110512 KB Output is correct
11 Correct 447 ms 42112 KB Output is correct
12 Correct 424 ms 44356 KB Output is correct
13 Correct 1008 ms 102828 KB Output is correct
14 Correct 291 ms 42108 KB Output is correct
15 Correct 252 ms 43320 KB Output is correct
16 Correct 215 ms 42108 KB Output is correct
17 Correct 222 ms 40536 KB Output is correct
18 Correct 166 ms 45332 KB Output is correct
19 Correct 9 ms 2380 KB Output is correct
20 Correct 112 ms 21656 KB Output is correct
21 Correct 213 ms 36452 KB Output is correct
22 Correct 205 ms 43344 KB Output is correct
23 Correct 294 ms 50940 KB Output is correct
24 Correct 203 ms 42052 KB Output is correct
25 Correct 220 ms 40120 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 8748 KB Output is correct
2 Correct 3316 ms 393324 KB Output is correct
3 Execution timed out 4102 ms 1048580 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 8748 KB Output is correct
2 Correct 3316 ms 393324 KB Output is correct
3 Execution timed out 4102 ms 1048580 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 574 ms 67812 KB Output is correct
21 Correct 871 ms 87492 KB Output is correct
22 Correct 576 ms 76724 KB Output is correct
23 Correct 493 ms 69448 KB Output is correct
24 Correct 571 ms 76740 KB Output is correct
25 Correct 755 ms 82424 KB Output is correct
26 Correct 615 ms 71828 KB Output is correct
27 Correct 1171 ms 110512 KB Output is correct
28 Correct 447 ms 42112 KB Output is correct
29 Correct 424 ms 44356 KB Output is correct
30 Correct 1008 ms 102828 KB Output is correct
31 Correct 291 ms 42108 KB Output is correct
32 Correct 252 ms 43320 KB Output is correct
33 Correct 215 ms 42108 KB Output is correct
34 Correct 222 ms 40536 KB Output is correct
35 Correct 166 ms 45332 KB Output is correct
36 Correct 9 ms 2380 KB Output is correct
37 Correct 112 ms 21656 KB Output is correct
38 Correct 213 ms 36452 KB Output is correct
39 Correct 205 ms 43344 KB Output is correct
40 Correct 294 ms 50940 KB Output is correct
41 Correct 203 ms 42052 KB Output is correct
42 Correct 220 ms 40120 KB Output is correct
43 Correct 56 ms 8748 KB Output is correct
44 Correct 3316 ms 393324 KB Output is correct
45 Execution timed out 4102 ms 1048580 KB Time limit exceeded
46 Halted 0 ms 0 KB -