oj.uz

Submission #951008

# Submission time Handle Problem Language Result Execution time Memory
951008 2024-03-21T04:11:09 Z Trisanu_Das Sky Walking (IOI19_walk) C++17
57 / 100
 4000 ms 538576 KB 
#include "walk.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define V vector
#define MP make_pair
#define EB emplace_back
#define PB push_back
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
 
const int INF = 1e9 + 7, N = 1e5 + 7;
const ll oo = 1e18;
 
vi asr[N], asl[N];
map<int, ll> dist[N];
map<int, vi> js[N];
vi ys[N], ks[N];
 
ll brute(vi& x, vi& h, vi& l, vi& r, vi& y, int s, int g) {
	int n = SZ(x);
	int m = SZ(l);
 
	ys[s].PB(0);
	ys[g].PB(0);
 
	auto add_ev = [&] (int i, int j) {
		js[i][y[j]].PB(j);
		ys[i].PB(y[j]);
		ks[j].PB(i);
	};
 
	vi sh(n); iota(ALL(sh), 0);
	sort(ALL(sh), [&] (int i, int j) {
		return h[i] < h[j];
	});
	vi sy(m); iota(ALL(sy), 0);
	sort(ALL(sy), [&] (int i, int j) {
		return y[i] < y[j];
	});
	set<int> st;
	while(SZ(sy)) {
		int j = sy.back(); sy.pop_back();
		while(SZ(sh) && h[sh.back()] >= y[j]) {
			st.insert(sh.back());
			sh.pop_back();
		}
		auto it = st.lower_bound(l[j]);
		while(it != st.end() && *it <= r[j]) {
			add_ev(*it, j);
			it++;
		}
	}
 
	for(int i = 0; i < n; i++) {
		sort(ALL(ys[i]));
		ys[i].resize(unique(ALL(ys[i])) - ys[i].begin());
	}
 
	auto get_edges = [&] (int i, int yy) {
		V<pair<pi, int>> res;
		int pos = lower_bound(ALL(ys[i]), yy) - ys[i].begin();
		for(int _ = max(pos - 1, 0); _ <= min(pos + 1, SZ(ys[i]) - 1); _++) {
			int yyy = ys[i][_];
			res.EB(pi(i, yyy), abs(yy - yyy));
		}
		for(int j:js[i][yy]) {
			for(int k:ks[j]) {
				res.EB(pi(k, yy), abs(x[i] - x[k]));
			}
		}
		return res;
	};
	priority_queue<pair<ll, pi>, V<pair<ll, pi>>, greater<pair<ll, pi>>> pq;
	pq.push(MP(0, pi(s, 0)));
	dist[s][0] = 0;
	
	while(pq.size()) {
		auto[dd, state] = pq.top(); pq.pop();
		auto[i, yy] = state;
		if(dd > dist[i][yy]) continue;
		V<pair<pi, int>> res = get_edges(i, yy);
		for(auto[nstate, w]:res) {
			auto[ni, nyy] = nstate;
			if(dist[ni].count(nyy) == 0 || dd + w < dist[ni][nyy]) {
				dist[ni][nyy] = dd + w;
				pq.push(MP(dd + w, nstate));
			}
		}
	}
 
	if(dist[g].count(0))
		return dist[g][0];
	return -1;
}
 
ll min_distance(vi x, vi h, vi l, vi r, vi y, int s, int g) {
	int n = SZ(x);
	int m = SZ(l);
	if(s != 0 || g != n - 1) {
		return brute(x, h, l, r, y, s, g);
	}
 
	for(int i = 0; i < m; i++) {
		asl[l[i]].PB(y[i]);
		asr[r[i]].PB(y[i]);
	}
	map<int, ll> mp;
	mp[0] = 0;
	asr[0].PB(0);
 
	for(int i = 0; i < n; i++) {
		set<int> no;
		for(int yy:asl[i]) {
			no.insert(yy);
			auto it = mp.lower_bound(yy);
			ll d = oo;
			if(it != mp.end()) 
				d = min(d, it -> S + abs(yy - it -> F));
			if(it != mp.begin()) {
				it--;
				d = min(d, it -> S + abs(yy - it -> F));
			}
			mp[yy] = d;
		}
		if(i < n - 1) for(int yy:asr[i]) {
			if(no.count(yy)) continue;
			mp.erase(yy);
		}
		if(mp.empty()) return -1;
	}
 
	ll ans = oo;
	for(auto[yy, d]:mp)
		ans = min(ans, d + yy);
	return ans + x[n - 1] - x[0];
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19220 KB Output is correct
2 Correct 5 ms 19036 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19052 KB Output is correct
5 Correct 6 ms 19292 KB Output is correct
6 Correct 5 ms 19292 KB Output is correct
7 Correct 5 ms 19232 KB Output is correct
8 Correct 5 ms 19448 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 5 ms 19228 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19036 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 6 ms 19032 KB Output is correct
15 Correct 5 ms 19036 KB Output is correct
16 Correct 5 ms 19036 KB Output is correct
17 Correct 5 ms 19036 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19036 KB Output is correct
2 Correct 5 ms 19036 KB Output is correct
3 Correct 1627 ms 154044 KB Output is correct
4 Correct 998 ms 161700 KB Output is correct
5 Correct 402 ms 104872 KB Output is correct
6 Correct 402 ms 95572 KB Output is correct
7 Correct 413 ms 105032 KB Output is correct
8 Correct 2442 ms 190868 KB Output is correct
9 Correct 642 ms 110992 KB Output is correct
10 Correct 1540 ms 215624 KB Output is correct
11 Correct 515 ms 90796 KB Output is correct
12 Correct 75 ms 29396 KB Output is correct
13 Correct 81 ms 29392 KB Output is correct
14 Correct 190 ms 54876 KB Output is correct
15 Correct 281 ms 69300 KB Output is correct
16 Correct 275 ms 70592 KB Output is correct
17 Correct 286 ms 68640 KB Output is correct
18 Correct 103 ms 34844 KB Output is correct
19 Correct 11 ms 21592 KB Output is correct
20 Correct 92 ms 43188 KB Output is correct
21 Correct 58 ms 27220 KB Output is correct
22 Correct 66 ms 29368 KB Output is correct
23 Correct 85 ms 31120 KB Output is correct
24 Correct 63 ms 29080 KB Output is correct
25 Correct 59 ms 27720 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 21336 KB Output is correct
2 Correct 73 ms 23008 KB Output is correct
3 Correct 75 ms 25616 KB Output is correct
4 Correct 98 ms 31312 KB Output is correct
5 Correct 117 ms 35668 KB Output is correct
6 Correct 115 ms 33712 KB Output is correct
7 Correct 54 ms 27980 KB Output is correct
8 Correct 75 ms 33640 KB Output is correct
9 Correct 103 ms 35196 KB Output is correct
10 Correct 86 ms 34636 KB Output is correct
11 Correct 13 ms 20572 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 21336 KB Output is correct
2 Correct 73 ms 23008 KB Output is correct
3 Correct 75 ms 25616 KB Output is correct
4 Correct 98 ms 31312 KB Output is correct
5 Correct 117 ms 35668 KB Output is correct
6 Correct 115 ms 33712 KB Output is correct
7 Correct 54 ms 27980 KB Output is correct
8 Correct 75 ms 33640 KB Output is correct
9 Correct 103 ms 35196 KB Output is correct
10 Correct 86 ms 34636 KB Output is correct
11 Correct 13 ms 20572 KB Output is correct
12 Correct 75 ms 25684 KB Output is correct
13 Correct 59 ms 31024 KB Output is correct
14 Correct 121 ms 35664 KB Output is correct
15 Correct 85 ms 31312 KB Output is correct
16 Correct 90 ms 31380 KB Output is correct
17 Correct 81 ms 31316 KB Output is correct
18 Correct 84 ms 31060 KB Output is correct
19 Correct 88 ms 31568 KB Output is correct
20 Correct 58 ms 27624 KB Output is correct
21 Correct 23 ms 22824 KB Output is correct
22 Correct 71 ms 28928 KB Output is correct
23 Correct 72 ms 29472 KB Output is correct
24 Correct 70 ms 30736 KB Output is correct
25 Correct 67 ms 29404 KB Output is correct
26 Correct 74 ms 33316 KB Output is correct
27 Correct 122 ms 35288 KB Output is correct
28 Correct 57 ms 30804 KB Output is correct
29 Correct 116 ms 33640 KB Output is correct
30 Correct 58 ms 27732 KB Output is correct
31 Correct 109 ms 35004 KB Output is correct
32 Correct 71 ms 32284 KB Output is correct
33 Correct 75 ms 33364 KB Output is correct
34 Correct 74 ms 32592 KB Output is correct
35 Correct 76 ms 31360 KB Output is correct
36 Correct 64 ms 30900 KB Output is correct
37 Correct 60 ms 30452 KB Output is correct
38 Correct 67 ms 32540 KB Output is correct
39 Correct 82 ms 33932 KB Output is correct
40 Correct 67 ms 32088 KB Output is correct
41 Correct 59 ms 30544 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19220 KB Output is correct
2 Correct 5 ms 19036 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19052 KB Output is correct
5 Correct 6 ms 19292 KB Output is correct
6 Correct 5 ms 19292 KB Output is correct
7 Correct 5 ms 19232 KB Output is correct
8 Correct 5 ms 19448 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 5 ms 19228 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19036 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 6 ms 19032 KB Output is correct
15 Correct 5 ms 19036 KB Output is correct
16 Correct 5 ms 19036 KB Output is correct
17 Correct 5 ms 19036 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 5 ms 19036 KB Output is correct
20 Correct 1627 ms 154044 KB Output is correct
21 Correct 998 ms 161700 KB Output is correct
22 Correct 402 ms 104872 KB Output is correct
23 Correct 402 ms 95572 KB Output is correct
24 Correct 413 ms 105032 KB Output is correct
25 Correct 2442 ms 190868 KB Output is correct
26 Correct 642 ms 110992 KB Output is correct
27 Correct 1540 ms 215624 KB Output is correct
28 Correct 515 ms 90796 KB Output is correct
29 Correct 75 ms 29396 KB Output is correct
30 Correct 81 ms 29392 KB Output is correct
31 Correct 190 ms 54876 KB Output is correct
32 Correct 281 ms 69300 KB Output is correct
33 Correct 275 ms 70592 KB Output is correct
34 Correct 286 ms 68640 KB Output is correct
35 Correct 103 ms 34844 KB Output is correct
36 Correct 11 ms 21592 KB Output is correct
37 Correct 92 ms 43188 KB Output is correct
38 Correct 58 ms 27220 KB Output is correct
39 Correct 66 ms 29368 KB Output is correct
40 Correct 85 ms 31120 KB Output is correct
41 Correct 63 ms 29080 KB Output is correct
42 Correct 59 ms 27720 KB Output is correct
43 Correct 22 ms 21336 KB Output is correct
44 Correct 73 ms 23008 KB Output is correct
45 Correct 75 ms 25616 KB Output is correct
46 Correct 98 ms 31312 KB Output is correct
47 Correct 117 ms 35668 KB Output is correct
48 Correct 115 ms 33712 KB Output is correct
49 Correct 54 ms 27980 KB Output is correct
50 Correct 75 ms 33640 KB Output is correct
51 Correct 103 ms 35196 KB Output is correct
52 Correct 86 ms 34636 KB Output is correct
53 Correct 13 ms 20572 KB Output is correct
54 Correct 75 ms 25684 KB Output is correct
55 Correct 59 ms 31024 KB Output is correct
56 Correct 121 ms 35664 KB Output is correct
57 Correct 85 ms 31312 KB Output is correct
58 Correct 90 ms 31380 KB Output is correct
59 Correct 81 ms 31316 KB Output is correct
60 Correct 84 ms 31060 KB Output is correct
61 Correct 88 ms 31568 KB Output is correct
62 Correct 58 ms 27624 KB Output is correct
63 Correct 23 ms 22824 KB Output is correct
64 Correct 71 ms 28928 KB Output is correct
65 Correct 72 ms 29472 KB Output is correct
66 Correct 70 ms 30736 KB Output is correct
67 Correct 67 ms 29404 KB Output is correct
68 Correct 74 ms 33316 KB Output is correct
69 Correct 122 ms 35288 KB Output is correct
70 Correct 57 ms 30804 KB Output is correct
71 Correct 116 ms 33640 KB Output is correct
72 Correct 58 ms 27732 KB Output is correct
73 Correct 109 ms 35004 KB Output is correct
74 Correct 71 ms 32284 KB Output is correct
75 Correct 75 ms 33364 KB Output is correct
76 Correct 74 ms 32592 KB Output is correct
77 Correct 76 ms 31360 KB Output is correct
78 Correct 64 ms 30900 KB Output is correct
79 Correct 60 ms 30452 KB Output is correct
80 Correct 67 ms 32540 KB Output is correct
81 Correct 82 ms 33932 KB Output is correct
82 Correct 67 ms 32088 KB Output is correct
83 Correct 59 ms 30544 KB Output is correct
84 Correct 93 ms 32596 KB Output is correct
85 Execution timed out 4051 ms 538576 KB Time limit exceeded
86 Halted 0 ms 0 KB -