oj.uz

답안 #147051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147051 2019-08-27T10:21:39 Z gs14004 Sky Walking (IOI19_walk) C++17
100 / 100
 2058 ms 172540 KB 
#include "walk.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using namespace std;
using lint = long long;
using pi = pair<lint, int>;
const int MAXN = 100005;
const int MAXV = 2000005;

struct intv{
	int s, e, x;
	bool operator<(const intv &i)const{
		return x < i.x;
	}
};

struct point{
	int x, y, idx;
};

int n, m;
vector<int> witness[MAXN];
vector<pi> event[MAXN];
vector<pi> gph[MAXV];
lint dist[MAXV];

lint dijkstra(int s, int e){
	priority_queue<pi, vector<pi>, greater<pi> > pq;
	memset(dist, 0x3f, sizeof(dist));
	dist[s] = 0;
	pq.emplace(0, s);
	while(!pq.empty()){
		auto x = pq.top();
		pq.pop();
		if(dist[x.second] != x.first) continue;
		for(auto &j : gph[x.second]){
			if(dist[j.second] > x.first + j.first){
				dist[j.second] = x.first + j.first;
				pq.emplace(dist[j.second], j.second);
			}
		}
	}
	if(dist[e] > 1e17) return -1;
	return dist[e];
}

void add_edge(point x, point y){
//	printf("(%d, %d) <-> (%d, %d)\n", x.x, x.y, y.x, y.y);
	int dist = abs(x.x - y.x) + abs(x.y - y.y);
	gph[x.idx].emplace_back(dist, y.idx);
	gph[y.idx].emplace_back(dist, x.idx);
}

void make_vertex(vector<intv> v){
	for(auto &i : v){
		event[i.s].emplace_back(i.x, +1);
		event[i.e+1].emplace_back(i.x, -1);
	}
	multiset<int> swp;
	for(int i=0; i<n; i++){
		for(auto &j : event[i]){
			if(j.second == +1) swp.insert(j.first);
			else swp.erase(swp.find(j.first));
		}
		vector<int> nxt = witness[i];
		for(auto &j : witness[i]){
			if(j == 0) continue;
			auto l = swp.upper_bound(j);
			if(l != swp.end()) nxt.push_back(*l);
			l = swp.lower_bound(j);
			if(l != swp.begin()) nxt.push_back(*prev(l));
		}
		sort(nxt.begin(), nxt.end());
		nxt.resize(unique(nxt.begin(), nxt.end()) - nxt.begin());
		witness[i] = nxt;
	}
}

long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int e) {
	n = sz(x);
	m = sz(l);
	for(int i=0; i<m; i++){
		witness[l[i]].push_back(y[i]);
		witness[r[i]].push_back(y[i]);
	}
	witness[s].push_back(0);
	witness[e].push_back(0);
	vector<pi> points;
	vector<intv> hors;
	set<int> alive;
	for(int i=0; i<n; i++){
		points.emplace_back(h[i], i);
		alive.insert(i);
	}
	for(int i=0; i<m; i++) hors.push_back({l[i], r[i], y[i]});
	sort(points.begin(), points.end());
	sort(hors.begin(), hors.end());
	int ptr = 0;
	for(auto &i : hors){
		while(ptr < sz(points) && points[ptr].first < i.x){
			alive.erase(points[ptr++].second);
		}
		if(i.s <= s && s <= i.e){
			auto it = alive.lower_bound(s);
			witness[*it].push_back(i.x);
			if(*it != s) witness[*prev(it)].push_back(i.x);
		}
		if(i.s <= e && e <= i.e){
			auto it = alive.lower_bound(e);
			witness[*it].push_back(i.x);
			if(*it != e) witness[*prev(it)].push_back(i.x);
		}
	}
	make_vertex(hors);
	vector<point> ans;
	for(int i=0; i<n; i++){
		for(auto &j : witness[i]){
			int num = ans.size();
			ans.push_back({x[i], j, num});
		}
	}
	assert(sz(ans) < MAXV);
	auto cmpx = [&](const point &x, const point &y) { return pi(x.x, x.y) < pi(y.x, y.y); };
	auto cmpy = [&](const point &x, const point &y) { return pi(x.y, x.x) < pi(y.y, y.x); };
	sort(ans.begin(), ans.end(), cmpx);
	for(int i=0; i<n; i++){
		int st = lower_bound(ans.begin(), ans.end(), (point){x[i], 0, -1}, cmpx) - ans.begin();
		int ed = upper_bound(ans.begin(), ans.end(), (point){x[i], h[i], -1}, cmpx) - ans.begin();
		for(int j=st+1; j<ed; j++){
			add_edge(ans[j-1], ans[j]);
		}
	}
	sort(ans.begin(), ans.end(), cmpy);
	for(int i=0; i<m; i++){
		int st = lower_bound(ans.begin(), ans.end(), (point){x[l[i]], y[i], -1}, cmpy) - ans.begin();
		int ed = upper_bound(ans.begin(), ans.end(), (point){x[r[i]], y[i], -1}, cmpy) - ans.begin();
		for(int j=st+1; j<ed; j++){
			add_edge(ans[j-1], ans[j]);
		}
	}
	s = lower_bound(ans.begin(), ans.end(), (point){x[s], 0, -1}, cmpy)->idx;
	e = lower_bound(ans.begin(), ans.end(), (point){x[e], 0, -1}, cmpy)->idx;
	return dijkstra(s, e);
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 67704 KB Output is correct
2 Correct 65 ms 67576 KB Output is correct
3 Correct 64 ms 67672 KB Output is correct
4 Correct 63 ms 67704 KB Output is correct
5 Correct 64 ms 67732 KB Output is correct
6 Correct 64 ms 67704 KB Output is correct
7 Correct 65 ms 67704 KB Output is correct
8 Correct 64 ms 67704 KB Output is correct
9 Correct 64 ms 67668 KB Output is correct
10 Correct 64 ms 67672 KB Output is correct
11 Correct 64 ms 67720 KB Output is correct
12 Correct 65 ms 67576 KB Output is correct
13 Correct 64 ms 67676 KB Output is correct
14 Correct 62 ms 67604 KB Output is correct
15 Correct 75 ms 67576 KB Output is correct
16 Correct 75 ms 67588 KB Output is correct
17 Correct 64 ms 67704 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 67600 KB Output is correct
2 Correct 64 ms 67580 KB Output is correct
3 Correct 875 ms 120668 KB Output is correct
4 Correct 945 ms 125016 KB Output is correct
5 Correct 640 ms 112856 KB Output is correct
6 Correct 637 ms 109764 KB Output is correct
7 Correct 675 ms 116388 KB Output is correct
8 Correct 937 ms 126912 KB Output is correct
9 Correct 891 ms 124456 KB Output is correct
10 Correct 999 ms 131804 KB Output is correct
11 Correct 741 ms 113248 KB Output is correct
12 Correct 559 ms 99556 KB Output is correct
13 Correct 974 ms 132432 KB Output is correct
14 Correct 602 ms 104260 KB Output is correct
15 Correct 621 ms 105692 KB Output is correct
16 Correct 592 ms 105180 KB Output is correct
17 Correct 597 ms 103816 KB Output is correct
18 Correct 801 ms 106316 KB Output is correct
19 Correct 78 ms 69320 KB Output is correct
20 Correct 254 ms 85008 KB Output is correct
21 Correct 482 ms 101860 KB Output is correct
22 Correct 526 ms 103928 KB Output is correct
23 Correct 770 ms 112200 KB Output is correct
24 Correct 561 ms 104248 KB Output is correct
25 Correct 576 ms 102900 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 79184 KB Output is correct
2 Correct 1164 ms 136272 KB Output is correct
3 Correct 1219 ms 142168 KB Output is correct
4 Correct 1314 ms 152652 KB Output is correct
5 Correct 1570 ms 155460 KB Output is correct
6 Correct 1436 ms 148552 KB Output is correct
7 Correct 694 ms 115740 KB Output is correct
8 Correct 492 ms 104036 KB Output is correct
9 Correct 1367 ms 142864 KB Output is correct
10 Correct 647 ms 116080 KB Output is correct
11 Correct 97 ms 72428 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 79184 KB Output is correct
2 Correct 1164 ms 136272 KB Output is correct
3 Correct 1219 ms 142168 KB Output is correct
4 Correct 1314 ms 152652 KB Output is correct
5 Correct 1570 ms 155460 KB Output is correct
6 Correct 1436 ms 148552 KB Output is correct
7 Correct 694 ms 115740 KB Output is correct
8 Correct 492 ms 104036 KB Output is correct
9 Correct 1367 ms 142864 KB Output is correct
10 Correct 647 ms 116080 KB Output is correct
11 Correct 97 ms 72428 KB Output is correct
12 Correct 1213 ms 141544 KB Output is correct
13 Correct 1151 ms 147036 KB Output is correct
14 Correct 1593 ms 150692 KB Output is correct
15 Correct 1047 ms 135160 KB Output is correct
16 Correct 1151 ms 134236 KB Output is correct
17 Correct 1240 ms 147548 KB Output is correct
18 Correct 1027 ms 135128 KB Output is correct
19 Correct 1096 ms 134080 KB Output is correct
20 Correct 781 ms 110204 KB Output is correct
21 Correct 196 ms 77672 KB Output is correct
22 Correct 862 ms 129984 KB Output is correct
23 Correct 782 ms 126212 KB Output is correct
24 Correct 602 ms 109916 KB Output is correct
25 Correct 708 ms 121820 KB Output is correct
26 Correct 539 ms 103472 KB Output is correct
27 Correct 1459 ms 152020 KB Output is correct
28 Correct 1036 ms 146024 KB Output is correct
29 Correct 1454 ms 144152 KB Output is correct
30 Correct 714 ms 111048 KB Output is correct
31 Correct 1388 ms 138420 KB Output is correct
32 Correct 605 ms 109128 KB Output is correct
33 Correct 618 ms 108508 KB Output is correct
34 Correct 683 ms 113332 KB Output is correct
35 Correct 712 ms 114268 KB Output is correct
36 Correct 570 ms 106764 KB Output is correct
37 Correct 472 ms 101832 KB Output is correct
38 Correct 518 ms 103780 KB Output is correct
39 Correct 744 ms 112132 KB Output is correct
40 Correct 543 ms 104136 KB Output is correct
41 Correct 554 ms 102888 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 67704 KB Output is correct
2 Correct 65 ms 67576 KB Output is correct
3 Correct 64 ms 67672 KB Output is correct
4 Correct 63 ms 67704 KB Output is correct
5 Correct 64 ms 67732 KB Output is correct
6 Correct 64 ms 67704 KB Output is correct
7 Correct 65 ms 67704 KB Output is correct
8 Correct 64 ms 67704 KB Output is correct
9 Correct 64 ms 67668 KB Output is correct
10 Correct 64 ms 67672 KB Output is correct
11 Correct 64 ms 67720 KB Output is correct
12 Correct 65 ms 67576 KB Output is correct
13 Correct 64 ms 67676 KB Output is correct
14 Correct 62 ms 67604 KB Output is correct
15 Correct 75 ms 67576 KB Output is correct
16 Correct 75 ms 67588 KB Output is correct
17 Correct 64 ms 67704 KB Output is correct
18 Correct 69 ms 67600 KB Output is correct
19 Correct 64 ms 67580 KB Output is correct
20 Correct 875 ms 120668 KB Output is correct
21 Correct 945 ms 125016 KB Output is correct
22 Correct 640 ms 112856 KB Output is correct
23 Correct 637 ms 109764 KB Output is correct
24 Correct 675 ms 116388 KB Output is correct
25 Correct 937 ms 126912 KB Output is correct
26 Correct 891 ms 124456 KB Output is correct
27 Correct 999 ms 131804 KB Output is correct
28 Correct 741 ms 113248 KB Output is correct
29 Correct 559 ms 99556 KB Output is correct
30 Correct 974 ms 132432 KB Output is correct
31 Correct 602 ms 104260 KB Output is correct
32 Correct 621 ms 105692 KB Output is correct
33 Correct 592 ms 105180 KB Output is correct
34 Correct 597 ms 103816 KB Output is correct
35 Correct 801 ms 106316 KB Output is correct
36 Correct 78 ms 69320 KB Output is correct
37 Correct 254 ms 85008 KB Output is correct
38 Correct 482 ms 101860 KB Output is correct
39 Correct 526 ms 103928 KB Output is correct
40 Correct 770 ms 112200 KB Output is correct
41 Correct 561 ms 104248 KB Output is correct
42 Correct 576 ms 102900 KB Output is correct
43 Correct 197 ms 79184 KB Output is correct
44 Correct 1164 ms 136272 KB Output is correct
45 Correct 1219 ms 142168 KB Output is correct
46 Correct 1314 ms 152652 KB Output is correct
47 Correct 1570 ms 155460 KB Output is correct
48 Correct 1436 ms 148552 KB Output is correct
49 Correct 694 ms 115740 KB Output is correct
50 Correct 492 ms 104036 KB Output is correct
51 Correct 1367 ms 142864 KB Output is correct
52 Correct 647 ms 116080 KB Output is correct
53 Correct 97 ms 72428 KB Output is correct
54 Correct 1213 ms 141544 KB Output is correct
55 Correct 1151 ms 147036 KB Output is correct
56 Correct 1593 ms 150692 KB Output is correct
57 Correct 1047 ms 135160 KB Output is correct
58 Correct 1151 ms 134236 KB Output is correct
59 Correct 1240 ms 147548 KB Output is correct
60 Correct 1027 ms 135128 KB Output is correct
61 Correct 1096 ms 134080 KB Output is correct
62 Correct 781 ms 110204 KB Output is correct
63 Correct 196 ms 77672 KB Output is correct
64 Correct 862 ms 129984 KB Output is correct
65 Correct 782 ms 126212 KB Output is correct
66 Correct 602 ms 109916 KB Output is correct
67 Correct 708 ms 121820 KB Output is correct
68 Correct 539 ms 103472 KB Output is correct
69 Correct 1459 ms 152020 KB Output is correct
70 Correct 1036 ms 146024 KB Output is correct
71 Correct 1454 ms 144152 KB Output is correct
72 Correct 714 ms 111048 KB Output is correct
73 Correct 1388 ms 138420 KB Output is correct
74 Correct 605 ms 109128 KB Output is correct
75 Correct 618 ms 108508 KB Output is correct
76 Correct 683 ms 113332 KB Output is correct
77 Correct 712 ms 114268 KB Output is correct
78 Correct 570 ms 106764 KB Output is correct
79 Correct 472 ms 101832 KB Output is correct
80 Correct 518 ms 103780 KB Output is correct
81 Correct 744 ms 112132 KB Output is correct
82 Correct 543 ms 104136 KB Output is correct
83 Correct 554 ms 102888 KB Output is correct
84 Correct 182 ms 77684 KB Output is correct
85 Correct 1257 ms 142820 KB Output is correct
86 Correct 1772 ms 159412 KB Output is correct
87 Correct 189 ms 82664 KB Output is correct
88 Correct 242 ms 79976 KB Output is correct
89 Correct 190 ms 82640 KB Output is correct
90 Correct 103 ms 72056 KB Output is correct
91 Correct 77 ms 67832 KB Output is correct
92 Correct 116 ms 70808 KB Output is correct
93 Correct 541 ms 98628 KB Output is correct
94 Correct 194 ms 77784 KB Output is correct
95 Correct 886 ms 133212 KB Output is correct
96 Correct 768 ms 126716 KB Output is correct
97 Correct 622 ms 110204 KB Output is correct
98 Correct 700 ms 121652 KB Output is correct
99 Correct 2058 ms 172540 KB Output is correct
100 Correct 1321 ms 147496 KB Output is correct
101 Correct 1617 ms 151204 KB Output is correct
102 Correct 728 ms 111200 KB Output is correct
103 Correct 594 ms 105820 KB Output is correct
104 Correct 578 ms 106184 KB Output is correct
105 Correct 672 ms 110340 KB Output is correct
106 Correct 632 ms 107484 KB Output is correct
107 Correct 687 ms 108800 KB Output is correct
108 Correct 130 ms 73728 KB Output is correct
109 Correct 1074 ms 130692 KB Output is correct
110 Correct 1105 ms 146064 KB Output is correct
111 Correct 1095 ms 145700 KB Output is correct
112 Correct 706 ms 112964 KB Output is correct
113 Correct 676 ms 109788 KB Output is correct