oj.uz

Submission #831160

# Submission time Handle Problem Language Result Execution time Memory
831160 2023-08-19T20:05:46 Z PurpleCrayon Sky Walking (IOI19_walk) C++17
33 / 100
 211 ms 30340 KB 
#include "walk.h"
#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 2e5+10;
const ll INF = 1e18+10;

template <class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;

int n, m;
vector<pair<int, int>> adj[N];
ll dist[N];

void add_edge(int a, int b, int w) {
	adj[a].emplace_back(b, w);
	adj[b].emplace_back(a, w);
}

void dijkstra(int S) {
	fill(dist, dist + N, INF);

	min_pq<pair<ll, int>> pq;
	pq.push({dist[S] = 0, S});

	while (!pq.empty()) {
		auto [d_c, c] = pq.top(); pq.pop();
		if (dist[c] != d_c) continue;
		for (auto [nxt, w] : adj[c]) {
			if (dist[nxt] > dist[c] + w) {
				dist[nxt] = dist[c] + w;
				pq.push({dist[nxt], nxt});
			}
		}
	}
}

long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
	n = sz(x), m = sz(l);
	assert(s == 0 && g == n-1);

	auto build = [&]() {
		vector<vector<int>> ev(n);
		for (int i = 0; i < m; i++) {
			ev[l[i]].push_back(i);
			ev[r[i]].push_back(i);
		}

		vector<bool> on(m);
		set<pair<int, int>> s;
		for (int i = 0; i < n; i++) {
			for (int x : ev[i]) if (!on[x]) {
				auto me = s.insert({y[x], x}).first;

				{
					auto it = next(me);
					if (it != s.end() && it->first <= h[i]) {
						add_edge(x, it->second, it->first - y[x]);
					}
				}

				{
					if (me != s.begin()) {
						auto it = prev(me);
						add_edge(x, it->second, y[x] - it->first);
					}
				}
			}

			for (int x : ev[i]) if (on[x]) {
				auto me = s.find({y[x], x});
				{
					auto it = next(me);
					if (it != s.end() && it->first <= h[i]) {
						add_edge(x, it->second, it->first - y[x]);
					}
				}

				{
					if (me != s.begin()) {
						auto it = prev(me);
						add_edge(x, it->second, y[x] - it->first);
					}
				}

				s.erase({y[x], x});
			}

			for (int x : ev[i]) on[x] = !on[x];
		}
	};

	build();
	int S = m;
	for (int i = 0; i < m; i++) if (l[i] == 0) {
		add_edge(S, i, y[i]);
	}
	dijkstra(S);

	ll ans = INF;
	for (int i = 0; i < m; i++) if (r[i] == n-1) {
		ans = min(ans, dist[i] + y[i]);
	}

	// cerr << x[n-1] - x[0] << ' ' << ans << endl;
	if (ans == INF) return -1;
	return ans + x[n-1] - x[0];
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 9940 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 9984 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12980 KB Output is correct
2 Correct 125 ms 22048 KB Output is correct
3 Correct 140 ms 22880 KB Output is correct
4 Correct 164 ms 28300 KB Output is correct
5 Correct 211 ms 29964 KB Output is correct
6 Correct 205 ms 29852 KB Output is correct
7 Correct 75 ms 20236 KB Output is correct
8 Correct 89 ms 23116 KB Output is correct
9 Correct 188 ms 30280 KB Output is correct
10 Correct 122 ms 25744 KB Output is correct
11 Correct 13 ms 8056 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12980 KB Output is correct
2 Correct 125 ms 22048 KB Output is correct
3 Correct 140 ms 22880 KB Output is correct
4 Correct 164 ms 28300 KB Output is correct
5 Correct 211 ms 29964 KB Output is correct
6 Correct 205 ms 29852 KB Output is correct
7 Correct 75 ms 20236 KB Output is correct
8 Correct 89 ms 23116 KB Output is correct
9 Correct 188 ms 30280 KB Output is correct
10 Correct 122 ms 25744 KB Output is correct
11 Correct 13 ms 8056 KB Output is correct
12 Correct 131 ms 22720 KB Output is correct
13 Correct 152 ms 28236 KB Output is correct
14 Correct 201 ms 29852 KB Output is correct
15 Correct 132 ms 25020 KB Output is correct
16 Correct 139 ms 28892 KB Output is correct
17 Correct 125 ms 26760 KB Output is correct
18 Correct 125 ms 24940 KB Output is correct
19 Correct 149 ms 28804 KB Output is correct
20 Correct 87 ms 20324 KB Output is correct
21 Correct 24 ms 10956 KB Output is correct
22 Correct 102 ms 24936 KB Output is correct
23 Correct 98 ms 25068 KB Output is correct
24 Correct 94 ms 23544 KB Output is correct
25 Correct 91 ms 24336 KB Output is correct
26 Correct 82 ms 22144 KB Output is correct
27 Correct 210 ms 30340 KB Output is correct
28 Correct 127 ms 28020 KB Output is correct
29 Correct 189 ms 29644 KB Output is correct
30 Correct 72 ms 20156 KB Output is correct
31 Correct 185 ms 30340 KB Output is correct
32 Correct 107 ms 23116 KB Output is correct
33 Correct 95 ms 23700 KB Output is correct
34 Correct 115 ms 26016 KB Output is correct
35 Correct 101 ms 24072 KB Output is correct
36 Correct 100 ms 23000 KB Output is correct
37 Correct 74 ms 20908 KB Output is correct
38 Correct 82 ms 22152 KB Output is correct
39 Correct 127 ms 26976 KB Output is correct
40 Correct 78 ms 21988 KB Output is correct
41 Correct 82 ms 21808 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 9940 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -