oj.uz

Submission #1058595

# Submission time Handle Problem Language Result Execution time Memory
1058595 2024-08-14T11:24:22 Z Unforgettablepl Sky Walking (IOI19_walk) C++17
57 / 100
 1994 ms 1048728 KB 
#include "walk.h"
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e15;

long long min_distance2(vector<int> x,vector<int> h,vector<int> l,
					   vector<int> r,vector<int> y,int s,int g){
	int n = x.size();
	int m = l.size();
	vector<vector<pair<int,int>>> points(n);
	vector<vector<pair<int,int>>> adj;
	int S = 0;
	vector<tuple<int,int,int>> skywalks;
	for(int i=0;i<m;i++)skywalks.emplace_back(y[i],l[i],r[i]);
	sort(skywalks.rbegin(), skywalks.rend());
	auto add_point = [&](int x,int h) {
		adj.emplace_back();
		if(!points[x].empty())adj[S].emplace_back(points[x].back().first,points[x].back().second-h);
		if(!points[x].empty())adj[points[x].back().first].emplace_back(S,points[x].back().second-h);
		points[x].emplace_back(S,h);
		return S++;
	};
	vector<pair<int,int>> sorted_buildings;
	for(int i=0;i<n;i++)sorted_buildings.emplace_back(h[i],i);
	sort(sorted_buildings.rbegin(),sorted_buildings.rend());
	auto iterb = sorted_buildings.begin();
	set<int> active;
	for(int i=0;i<m;i++){
		auto [height,left,right] = skywalks[i];
		while(iterb!=sorted_buildings.end() and iterb->first>=height)active.insert((iterb++)->second);
		auto last_point = add_point(left,height);
		auto last_x = x[left];
		for(auto iter=active.upper_bound(left);true;iter++){
			int j = *iter;
			auto curr_point = add_point(j,height);
			adj[curr_point].emplace_back(last_point,x[j]-last_x);
			adj[last_point].emplace_back(curr_point,x[j]-last_x);
			last_point=curr_point;
			last_x=x[j];
			if(*iter==right)break;
		}
	}
	for(int i=0;i<n;i++)add_point(i,0);
	priority_queue<pair<long long,int>> q;
	vector<bool> visited(S);
	s = points[s].back().first;
	g = points[g].back().first;
	q.emplace(0,s);
	while(!q.empty()) {
		auto [dist,idx] = q.top();q.pop();dist=-dist;
		if(visited[idx])continue;
		visited[idx]=true;
		if(idx==g)return dist;
		for(auto&[v,c]:adj[idx])if(!visited[v])q.emplace(-dist-c,v);
	}
	return -1;
}

long long min_distance(vector<int> x,vector<int> h,vector<int> l,
					   vector<int> r,vector<int> y,int s,int g){
	int n = x.size();
	if(s!=0 or g!=n-1)return min_distance2(x,h,l,r,y,s,g);
	int m = l.size();
	vector<vector<int>> starters(n);
	vector<vector<int>> ends(n);
	for(int i=0;i<m;i++) {
		starters[l[i]].emplace_back(y[i]);
		ends[r[i]].emplace_back(y[i]);
	}
	multiset<pair<int,long long>> offers;
	ends[0].emplace_back(0);
	offers.emplace(0,0);
	for(int i=0;i<n-1;i++) {
		for(int&ht:starters[i]) {
			auto iter = offers.lower_bound({ht,0});
			long long bestopt = INF;
			if(iter!=offers.end()) {
				// try
				bestopt=min(bestopt,iter->first-ht + iter->second);
			}
			if(iter!=offers.begin()) {
				--iter;
				// try
				bestopt=min(bestopt,ht-iter->first+iter->second);
			}
			offers.emplace(ht,bestopt);
		}
		for(int&ht:ends[i]) {
			offers.erase(offers.lower_bound({ht,0}));
		}
	}
	if(offers.empty())return -1;
	long long ans = x[g]-x[s]+offers.begin()->second+offers.begin()->first;
	if(ans>=INF)return -1;
	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 165 ms 66684 KB Output is correct
4 Correct 417 ms 82864 KB Output is correct
5 Correct 235 ms 73252 KB Output is correct
6 Correct 203 ms 71904 KB Output is correct
7 Correct 228 ms 74028 KB Output is correct
8 Correct 217 ms 82348 KB Output is correct
9 Correct 271 ms 70964 KB Output is correct
10 Correct 515 ms 128176 KB Output is correct
11 Correct 150 ms 43232 KB Output is correct
12 Correct 49 ms 17608 KB Output is correct
13 Correct 60 ms 17504 KB Output is correct
14 Correct 103 ms 45128 KB Output is correct
15 Correct 99 ms 44996 KB Output is correct
16 Correct 95 ms 43200 KB Output is correct
17 Correct 91 ms 43380 KB Output is correct
18 Correct 55 ms 17604 KB Output is correct
19 Correct 6 ms 2416 KB Output is correct
20 Correct 40 ms 24268 KB Output is correct
21 Correct 38 ms 13652 KB Output is correct
22 Correct 44 ms 16980 KB Output is correct
23 Correct 53 ms 18740 KB Output is correct
24 Correct 42 ms 16136 KB Output is correct
25 Correct 43 ms 14676 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3184 KB Output is correct
2 Correct 42 ms 4196 KB Output is correct
3 Correct 49 ms 5288 KB Output is correct
4 Correct 71 ms 13144 KB Output is correct
5 Correct 86 ms 17612 KB Output is correct
6 Correct 81 ms 15436 KB Output is correct
7 Correct 36 ms 10644 KB Output is correct
8 Correct 43 ms 15196 KB Output is correct
9 Correct 77 ms 16844 KB Output is correct
10 Correct 54 ms 15552 KB Output is correct
11 Correct 6 ms 3420 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3184 KB Output is correct
2 Correct 42 ms 4196 KB Output is correct
3 Correct 49 ms 5288 KB Output is correct
4 Correct 71 ms 13144 KB Output is correct
5 Correct 86 ms 17612 KB Output is correct
6 Correct 81 ms 15436 KB Output is correct
7 Correct 36 ms 10644 KB Output is correct
8 Correct 43 ms 15196 KB Output is correct
9 Correct 77 ms 16844 KB Output is correct
10 Correct 54 ms 15552 KB Output is correct
11 Correct 6 ms 3420 KB Output is correct
12 Correct 47 ms 5212 KB Output is correct
13 Correct 68 ms 13392 KB Output is correct
14 Correct 87 ms 17568 KB Output is correct
15 Correct 54 ms 13136 KB Output is correct
16 Correct 54 ms 13136 KB Output is correct
17 Correct 55 ms 13136 KB Output is correct
18 Correct 55 ms 13308 KB Output is correct
19 Correct 57 ms 13208 KB Output is correct
20 Correct 38 ms 10716 KB Output is correct
21 Correct 14 ms 6748 KB Output is correct
22 Correct 52 ms 11092 KB Output is correct
23 Correct 45 ms 11460 KB Output is correct
24 Correct 45 ms 12892 KB Output is correct
25 Correct 43 ms 11464 KB Output is correct
26 Correct 53 ms 15444 KB Output is correct
27 Correct 85 ms 17232 KB Output is correct
28 Correct 55 ms 12892 KB Output is correct
29 Correct 88 ms 15440 KB Output is correct
30 Correct 36 ms 10572 KB Output is correct
31 Correct 80 ms 16936 KB Output is correct
32 Correct 44 ms 13904 KB Output is correct
33 Correct 43 ms 15452 KB Output is correct
34 Correct 44 ms 14684 KB Output is correct
35 Correct 46 ms 13648 KB Output is correct
36 Correct 38 ms 13400 KB Output is correct
37 Correct 38 ms 12124 KB Output is correct
38 Correct 46 ms 15180 KB Output is correct
39 Correct 57 ms 16856 KB Output is correct
40 Correct 45 ms 14376 KB Output is correct
41 Correct 38 ms 13140 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 165 ms 66684 KB Output is correct
21 Correct 417 ms 82864 KB Output is correct
22 Correct 235 ms 73252 KB Output is correct
23 Correct 203 ms 71904 KB Output is correct
24 Correct 228 ms 74028 KB Output is correct
25 Correct 217 ms 82348 KB Output is correct
26 Correct 271 ms 70964 KB Output is correct
27 Correct 515 ms 128176 KB Output is correct
28 Correct 150 ms 43232 KB Output is correct
29 Correct 49 ms 17608 KB Output is correct
30 Correct 60 ms 17504 KB Output is correct
31 Correct 103 ms 45128 KB Output is correct
32 Correct 99 ms 44996 KB Output is correct
33 Correct 95 ms 43200 KB Output is correct
34 Correct 91 ms 43380 KB Output is correct
35 Correct 55 ms 17604 KB Output is correct
36 Correct 6 ms 2416 KB Output is correct
37 Correct 40 ms 24268 KB Output is correct
38 Correct 38 ms 13652 KB Output is correct
39 Correct 44 ms 16980 KB Output is correct
40 Correct 53 ms 18740 KB Output is correct
41 Correct 42 ms 16136 KB Output is correct
42 Correct 43 ms 14676 KB Output is correct
43 Correct 13 ms 3184 KB Output is correct
44 Correct 42 ms 4196 KB Output is correct
45 Correct 49 ms 5288 KB Output is correct
46 Correct 71 ms 13144 KB Output is correct
47 Correct 86 ms 17612 KB Output is correct
48 Correct 81 ms 15436 KB Output is correct
49 Correct 36 ms 10644 KB Output is correct
50 Correct 43 ms 15196 KB Output is correct
51 Correct 77 ms 16844 KB Output is correct
52 Correct 54 ms 15552 KB Output is correct
53 Correct 6 ms 3420 KB Output is correct
54 Correct 47 ms 5212 KB Output is correct
55 Correct 68 ms 13392 KB Output is correct
56 Correct 87 ms 17568 KB Output is correct
57 Correct 54 ms 13136 KB Output is correct
58 Correct 54 ms 13136 KB Output is correct
59 Correct 55 ms 13136 KB Output is correct
60 Correct 55 ms 13308 KB Output is correct
61 Correct 57 ms 13208 KB Output is correct
62 Correct 38 ms 10716 KB Output is correct
63 Correct 14 ms 6748 KB Output is correct
64 Correct 52 ms 11092 KB Output is correct
65 Correct 45 ms 11460 KB Output is correct
66 Correct 45 ms 12892 KB Output is correct
67 Correct 43 ms 11464 KB Output is correct
68 Correct 53 ms 15444 KB Output is correct
69 Correct 85 ms 17232 KB Output is correct
70 Correct 55 ms 12892 KB Output is correct
71 Correct 88 ms 15440 KB Output is correct
72 Correct 36 ms 10572 KB Output is correct
73 Correct 80 ms 16936 KB Output is correct
74 Correct 44 ms 13904 KB Output is correct
75 Correct 43 ms 15452 KB Output is correct
76 Correct 44 ms 14684 KB Output is correct
77 Correct 46 ms 13648 KB Output is correct
78 Correct 38 ms 13400 KB Output is correct
79 Correct 38 ms 12124 KB Output is correct
80 Correct 46 ms 15180 KB Output is correct
81 Correct 57 ms 16856 KB Output is correct
82 Correct 45 ms 14376 KB Output is correct
83 Correct 38 ms 13140 KB Output is correct
84 Correct 27 ms 11984 KB Output is correct
85 Runtime error 1994 ms 1048728 KB Execution killed with signal 9
86 Halted 0 ms 0 KB -