oj.uz

Submission #1067537

# Submission time Handle Problem Language Result Execution time Memory
1067537 2024-08-20T19:52:04 Z jamjanek Sky Walking (IOI19_walk) C++17
100 / 100
 1113 ms 145204 KB 
#include "walk.h"
#include<bits/stdc++.h>
using namespace std;

vector<int>l,r,y,x,h;

const int base = 1<<17;

int drzewo[2*base];

int wiekszeL(int x, int val){
	x+=base;
	while(drzewo[x]<val && x&(x-1)){
		if(x%2==1)x/=2;
		else x--;
	}
	if(drzewo[x]>=val){
		while(x<base)
			if(drzewo[x*2+1]>=val)
				x=x*2+1;
			else
				x=x*2;
		return x-base;
	}
	else
		return -1;
}
int wiekszeR(int x, int val){
	x+=base;
	while(drzewo[x]<val && x&(x+1)){
		if(x%2==0)x/=2;
		else x++;
	}
	if(drzewo[x]>=val){
		while(x<base)
			if(drzewo[x*2]>=val)
				x=x*2;
			else
				x=x*2+1;
		return x-base;
	}
	else
		return base;
}


int tree[2*base];
void ustaw(int w, int l, int p, int a, int b, int v){
	if(a<=l && p<=b){
		tree[w] = v;
		return;
	}
	if(b<l || p<a)return;
	if(tree[w]!=-1)
		tree[w*2] = tree[w*2+1] = tree[w];
	ustaw(w*2, l, (l+p)/2, a, b, v);
	ustaw(w*2+1, (l+p)/2+1, p, a, b, v);
	tree[w] = -1;
}
int odczyt(int w){
	int res = -1;
	w+=base;
	while(w>0){
		if(tree[w]!=-1)
			res = tree[w];
		w/=2;
	}
	return res;
}

void dodaj(int a, int b, int h){
	l.push_back(a);
	r.push_back(b);
	y.push_back(h);
}
vector<pair<int,long long>>graf[700010];
long long dist[700010];
bool odw[700010];
map<pair<int,int>,int>mapa;
long long odl(pair<int,int>a, pair<int,int>b){
	return abs(a.second-b.second);
}
long long odl1(pair<int,int>a, pair<int,int>b){
	return abs(x[a.first]-x[b.first]);
}
map<int,vector<pair<int,int>>>poziomy;
long long min_distance(vector<int> X, vector<int> H, vector<int> L, vector<int> R, vector<int> Y, int s, int g) {
	x = X;
	h = H;
	// podzielic kazda pozioma
	// dla kazdej poziomej wyznaczyc pozioma w dol z obu koncy
	vector<tuple<int,int,int,int>>przedzialy;
	int n = x.size();
	int m = L.size();
	int i;
	for(i=0;i<n;i++)
		drzewo[i+base]=h[i];
	for(i=base-1;i>0;i--)
		drzewo[i]=max(drzewo[i*2], drzewo[i*2+1]);
	if(s>g)swap(s,g);
	for(i=0;i<m;i++){
		poziomy[Y[i]].push_back({L[i],R[i]});
		if(L[i]<s && R[i]>g){
//			printf("%d 3\n", i);
			dodaj(L[i],s,Y[i]);
			dodaj(s,g,Y[i]);
			dodaj(g,R[i],Y[i]);
		}
		else if(L[i]<s && R[i]>s){
//			printf("%d 2\n", i);
			dodaj(L[i],s,Y[i]);
			dodaj(s,R[i],Y[i]);
		}
		else if(g<R[i] && L[i]<g){
//			printf("%d 2\n", i);
			dodaj(L[i],g,Y[i]);
			dodaj(g,R[i],Y[i]);
		}
		else{
//			printf("%d 1\n");
			dodaj(L[i],R[i],Y[i]);
		}
	}
	m = l.size();
	//for(i=0;i<m;i++)printf("%d %d %d %d\n", y[i], l[i], r[i], i);printf("\n");
	for(i=0;i<m;i++)
		przedzialy.push_back({y[i],l[i],r[i],0});
	sort(przedzialy.begin(), przedzialy.end());
	for(i=0;i<m;i++)
		get<3>(przedzialy[i]) = i;
	for(i=0;i<n;i++)tree[i+base] = -1;
	for(i=base-1;i>0;i--)
		tree[i] = -1;
	ustaw(1, 0,base-1,s,s,0);
	ustaw(1, 0,base-1,g,g,0);
	mapa[{s,0}]=0;
	mapa[{g,0}]=1;
	for(auto j: przedzialy){
		auto [Y,L,R,i] = j;
		int a = wiekszeR(L, Y);
		if(a<=R){
			int b = odczyt(a);
			if(b!=-1 && mapa.find({a, b})==mapa.end())
				mapa[{a,b}] = mapa.size();
			if(mapa.find({a, Y})==mapa.end())
				mapa[{a,Y}] = mapa.size();
		}
		a = wiekszeL(R,Y);
		if(a>=L){
			int b = odczyt(a);
			if(b!=-1 &&mapa.find({a, b})==mapa.end())
				mapa[{a,b}] = mapa.size();
			if(mapa.find({a, Y})==mapa.end())
				mapa[{a,Y}] = mapa.size();
		}
		ustaw(1, 0, base-1, L, R, Y);

/*
		for(int ij=0;ij<2;ij++){
			int a = odczyt(ij?R:L);
			int s = (a-2)/2;
			b = i*2+2+ij;
//			if(ij==0)printf("LEWY: %d %d(%d)\n", b, a,s);
//			else printf("PRAWY: %d %d(%d)\n", b, a,s);
			if(a==-1)continue;
			if(a==0 || a==1){
				graf[b].push_back({a,Y});
				graf[a].push_back({b,Y});
			}
			else{
				long long d;
				d=Y-get<0>(przedzialy[s])+abs(x[ij?R:L]-x[get<1>(przedzialy[s])]);
				graf[b].push_back({a, d});
				graf[a].push_back({b, d});
				d=Y-get<0>(przedzialy[s])+abs(x[ij?R:L]-x[get<2>(przedzialy[s])]);
				graf[b].push_back({a^1, d});
				graf[a^1].push_back({b, d});
				
			}
		}
		
		graf[b].push_back({b-1, abs(x[L]-x[R])});
		graf[b-1].push_back({b, abs(x[L]-x[R])});
		ustaw(1, 0, base-1, L, R, b-1);*/
//		printf("%d %d %d: %d %d\n", y[i], l[i], r[i], b-1, b);
	}/*
	for(i=0;i<(int)przedzialy.size()*2+2;i++){
		printf("%d: ", i);
		for(auto j: graf[i])
			printf("%d-%d ", j.first, j.second);
		printf("\n");
	}*/
	vector<pair<pair<int,int>,int>>wartosci;
	for(auto j=mapa.begin();j!=mapa.end();j++){
		auto xd = *j;
		wartosci.push_back({xd.first, xd.second});
		auto next = j;
		next++;
		if(next==mapa.end())break;
		if((*next).first.first==(*j).first.first){
			graf[(*next).second].push_back({(*j).second, odl((*j).first, (*next).first)});
			graf[(*j).second].push_back({(*next).second, odl((*j).first, (*next).first)});
		}
	}


	for(auto &j: poziomy){
		auto &vec = j.second;
		vector<pair<int,int>>dobre;
		sort(vec.begin(), vec.end());
		int koniec = (*vec.begin()).second, pocz = (*vec.begin()).first;
		for(auto k: vec){
			if(k.first<=koniec)
				koniec = max(k.second, koniec);
			else{
//				printf("%d %d\n", pocz, koniec);
				dobre.push_back({pocz, koniec});
				pocz = k.first;
				koniec = k.second;
			}
		}
		dobre.push_back({pocz,koniec});
//		for(auto ij: vec)printf("%d %d, ", ij.first, ij.second);printf("dsad\n");
		vec = dobre;
//		for(auto ij: dobre)printf("%d %d, ", ij.first, ij.second);printf("\n");
	}
		
	mapa.clear();
	for(auto j:wartosci)
		mapa[{j.first.second,j.first.first}]=j.second;



	for(auto j=mapa.begin();j!=mapa.end();j++){
		if((*j).first.first==0)continue;
		auto next = j;
		next++;
		if(next==mapa.end())break;
		if((*next).first.first==(*j).first.first){
			int a =(*j).first.second, b = (*next).first.second;
			auto &pom = poziomy[(*j).first.first];
			if(upper_bound(pom.begin(), pom.end(), make_pair(a,1000000000))==upper_bound(pom.begin(), pom.end(), make_pair(b,1000000000))){
				graf[(*next).second].push_back({(*j).second, x[(*next).first.second]-x[(*j).first.second]});
				graf[(*j).second].push_back({(*next).second, x[(*next).first.second]-x[(*j).first.second]});
			}
		}
	}/*
	for(auto j: wartosci)printf("%d %d %d\n", j.second, j.first.first, j.first.second);
	for(i=0;i<10;i++){
		printf("%d: ", i);
		for(auto j: graf[i])printf("%d-%d ", j.first,j.second);printf("\n");
	}*/
	priority_queue<pair<long long, int>>kolejka;
	dist[0] = 1;
	kolejka.push({-1,0});
	while(kolejka.size()){
		auto a = kolejka.top();
		//printf("%lld %d %d\n", -a.first, a.second);
		kolejka.pop();
		if(odw[a.second])continue;
		odw[a.second]=1;
		for(auto j: graf[a.second]){
			if(dist[j.first]==0 || dist[j.first]>dist[a.second]+j.second){
				dist[j.first]=dist[a.second]+j.second;
				kolejka.push({-dist[j.first], j.first});
			}
		}
	}
	return dist[1]-1;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 21852 KB Output is correct
2 Correct 4 ms 21852 KB Output is correct
3 Correct 626 ms 92444 KB Output is correct
4 Correct 545 ms 93872 KB Output is correct
5 Correct 342 ms 73908 KB Output is correct
6 Correct 321 ms 71348 KB Output is correct
7 Correct 343 ms 74168 KB Output is correct
8 Correct 652 ms 96560 KB Output is correct
9 Correct 524 ms 90828 KB Output is correct
10 Correct 575 ms 95620 KB Output is correct
11 Correct 469 ms 83116 KB Output is correct
12 Correct 335 ms 66348 KB Output is correct
13 Correct 577 ms 98248 KB Output is correct
14 Correct 278 ms 66212 KB Output is correct
15 Correct 251 ms 61416 KB Output is correct
16 Correct 206 ms 59828 KB Output is correct
17 Correct 206 ms 57712 KB Output is correct
18 Correct 270 ms 75272 KB Output is correct
19 Correct 14 ms 24028 KB Output is correct
20 Correct 127 ms 43996 KB Output is correct
21 Correct 198 ms 58124 KB Output is correct
22 Correct 200 ms 56908 KB Output is correct
23 Correct 256 ms 70384 KB Output is correct
24 Correct 210 ms 57532 KB Output is correct
25 Correct 207 ms 57264 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 33912 KB Output is correct
2 Correct 664 ms 100532 KB Output is correct
3 Correct 754 ms 103600 KB Output is correct
4 Correct 738 ms 105564 KB Output is correct
5 Correct 736 ms 108604 KB Output is correct
6 Correct 698 ms 103656 KB Output is correct
7 Correct 315 ms 63424 KB Output is correct
8 Correct 368 ms 66128 KB Output is correct
9 Correct 641 ms 99664 KB Output is correct
10 Correct 226 ms 64432 KB Output is correct
11 Correct 10 ms 23384 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 33912 KB Output is correct
2 Correct 664 ms 100532 KB Output is correct
3 Correct 754 ms 103600 KB Output is correct
4 Correct 738 ms 105564 KB Output is correct
5 Correct 736 ms 108604 KB Output is correct
6 Correct 698 ms 103656 KB Output is correct
7 Correct 315 ms 63424 KB Output is correct
8 Correct 368 ms 66128 KB Output is correct
9 Correct 641 ms 99664 KB Output is correct
10 Correct 226 ms 64432 KB Output is correct
11 Correct 10 ms 23384 KB Output is correct
12 Correct 746 ms 103340 KB Output is correct
13 Correct 665 ms 103240 KB Output is correct
14 Correct 742 ms 109540 KB Output is correct
15 Correct 476 ms 87968 KB Output is correct
16 Correct 446 ms 87712 KB Output is correct
17 Correct 513 ms 97440 KB Output is correct
18 Correct 465 ms 86940 KB Output is correct
19 Correct 462 ms 88528 KB Output is correct
20 Correct 317 ms 62396 KB Output is correct
21 Correct 21 ms 25692 KB Output is correct
22 Correct 448 ms 88244 KB Output is correct
23 Correct 416 ms 86704 KB Output is correct
24 Correct 307 ms 70040 KB Output is correct
25 Correct 393 ms 81720 KB Output is correct
26 Correct 232 ms 63600 KB Output is correct
27 Correct 767 ms 108888 KB Output is correct
28 Correct 628 ms 103516 KB Output is correct
29 Correct 681 ms 103344 KB Output is correct
30 Correct 303 ms 63640 KB Output is correct
31 Correct 629 ms 100432 KB Output is correct
32 Correct 208 ms 61236 KB Output is correct
33 Correct 203 ms 59948 KB Output is correct
34 Correct 238 ms 66496 KB Output is correct
35 Correct 285 ms 67892 KB Output is correct
36 Correct 260 ms 62448 KB Output is correct
37 Correct 199 ms 57776 KB Output is correct
38 Correct 198 ms 57188 KB Output is correct
39 Correct 259 ms 70376 KB Output is correct
40 Correct 198 ms 57544 KB Output is correct
41 Correct 199 ms 57268 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22104 KB Output is correct
2 Correct 3 ms 21644 KB Output is correct
3 Correct 3 ms 21848 KB Output is correct
4 Correct 3 ms 21852 KB Output is correct
5 Correct 3 ms 21852 KB Output is correct
6 Correct 4 ms 21848 KB Output is correct
7 Correct 3 ms 21852 KB Output is correct
8 Correct 4 ms 21852 KB Output is correct
9 Correct 3 ms 21852 KB Output is correct
10 Correct 4 ms 21852 KB Output is correct
11 Correct 4 ms 21852 KB Output is correct
12 Correct 4 ms 21852 KB Output is correct
13 Correct 4 ms 21852 KB Output is correct
14 Correct 4 ms 21848 KB Output is correct
15 Correct 3 ms 21852 KB Output is correct
16 Correct 3 ms 21852 KB Output is correct
17 Correct 3 ms 21852 KB Output is correct
18 Correct 4 ms 21852 KB Output is correct
19 Correct 4 ms 21852 KB Output is correct
20 Correct 626 ms 92444 KB Output is correct
21 Correct 545 ms 93872 KB Output is correct
22 Correct 342 ms 73908 KB Output is correct
23 Correct 321 ms 71348 KB Output is correct
24 Correct 343 ms 74168 KB Output is correct
25 Correct 652 ms 96560 KB Output is correct
26 Correct 524 ms 90828 KB Output is correct
27 Correct 575 ms 95620 KB Output is correct
28 Correct 469 ms 83116 KB Output is correct
29 Correct 335 ms 66348 KB Output is correct
30 Correct 577 ms 98248 KB Output is correct
31 Correct 278 ms 66212 KB Output is correct
32 Correct 251 ms 61416 KB Output is correct
33 Correct 206 ms 59828 KB Output is correct
34 Correct 206 ms 57712 KB Output is correct
35 Correct 270 ms 75272 KB Output is correct
36 Correct 14 ms 24028 KB Output is correct
37 Correct 127 ms 43996 KB Output is correct
38 Correct 198 ms 58124 KB Output is correct
39 Correct 200 ms 56908 KB Output is correct
40 Correct 256 ms 70384 KB Output is correct
41 Correct 210 ms 57532 KB Output is correct
42 Correct 207 ms 57264 KB Output is correct
43 Correct 61 ms 33912 KB Output is correct
44 Correct 664 ms 100532 KB Output is correct
45 Correct 754 ms 103600 KB Output is correct
46 Correct 738 ms 105564 KB Output is correct
47 Correct 736 ms 108604 KB Output is correct
48 Correct 698 ms 103656 KB Output is correct
49 Correct 315 ms 63424 KB Output is correct
50 Correct 368 ms 66128 KB Output is correct
51 Correct 641 ms 99664 KB Output is correct
52 Correct 226 ms 64432 KB Output is correct
53 Correct 10 ms 23384 KB Output is correct
54 Correct 746 ms 103340 KB Output is correct
55 Correct 665 ms 103240 KB Output is correct
56 Correct 742 ms 109540 KB Output is correct
57 Correct 476 ms 87968 KB Output is correct
58 Correct 446 ms 87712 KB Output is correct
59 Correct 513 ms 97440 KB Output is correct
60 Correct 465 ms 86940 KB Output is correct
61 Correct 462 ms 88528 KB Output is correct
62 Correct 317 ms 62396 KB Output is correct
63 Correct 21 ms 25692 KB Output is correct
64 Correct 448 ms 88244 KB Output is correct
65 Correct 416 ms 86704 KB Output is correct
66 Correct 307 ms 70040 KB Output is correct
67 Correct 393 ms 81720 KB Output is correct
68 Correct 232 ms 63600 KB Output is correct
69 Correct 767 ms 108888 KB Output is correct
70 Correct 628 ms 103516 KB Output is correct
71 Correct 681 ms 103344 KB Output is correct
72 Correct 303 ms 63640 KB Output is correct
73 Correct 629 ms 100432 KB Output is correct
74 Correct 208 ms 61236 KB Output is correct
75 Correct 203 ms 59948 KB Output is correct
76 Correct 238 ms 66496 KB Output is correct
77 Correct 285 ms 67892 KB Output is correct
78 Correct 260 ms 62448 KB Output is correct
79 Correct 199 ms 57776 KB Output is correct
80 Correct 198 ms 57188 KB Output is correct
81 Correct 259 ms 70376 KB Output is correct
82 Correct 198 ms 57544 KB Output is correct
83 Correct 199 ms 57268 KB Output is correct
84 Correct 57 ms 31688 KB Output is correct
85 Correct 778 ms 105652 KB Output is correct
86 Correct 886 ms 124520 KB Output is correct
87 Correct 41 ms 30288 KB Output is correct
88 Correct 41 ms 30352 KB Output is correct
89 Correct 42 ms 30284 KB Output is correct
90 Correct 19 ms 25616 KB Output is correct
91 Correct 4 ms 21852 KB Output is correct
92 Correct 19 ms 24756 KB Output is correct
93 Correct 215 ms 51544 KB Output is correct
94 Correct 22 ms 25684 KB Output is correct
95 Correct 495 ms 90968 KB Output is correct
96 Correct 419 ms 85672 KB Output is correct
97 Correct 320 ms 71096 KB Output is correct
98 Correct 400 ms 82868 KB Output is correct
99 Correct 1113 ms 145204 KB Output is correct
100 Correct 752 ms 106160 KB Output is correct
101 Correct 802 ms 115260 KB Output is correct
102 Correct 305 ms 63544 KB Output is correct
103 Correct 203 ms 61112 KB Output is correct
104 Correct 208 ms 60772 KB Output is correct
105 Correct 244 ms 66484 KB Output is correct
106 Correct 235 ms 63408 KB Output is correct
107 Correct 255 ms 66492 KB Output is correct
108 Correct 37 ms 27912 KB Output is correct
109 Correct 535 ms 88100 KB Output is correct
110 Correct 643 ms 104540 KB Output is correct
111 Correct 627 ms 103600 KB Output is correct
112 Correct 276 ms 66744 KB Output is correct
113 Correct 283 ms 64952 KB Output is correct