oj.uz

답안 #417278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417278 2021-06-03T14:18:38 Z Mlxa Sky Walking (IOI19_walk) C++14
10 / 100
 4000 ms 370292 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#include "walk.h"

namespace my {
const int N = 2e6 + 10;

int ff = 0;
vector<pair<int, int>> g[N];
vector<pair<int, int>> ys[N];

void edge(int v, int u, int w) {
	g[v].emplace_back(u, w);
	g[u].emplace_back(v, w);
}

using T = pair<ll, int>;
const ll INF = 1e18;
priority_queue<T, vector<T>, greater<T>> q;
ll dst[N];
int ground[N];

bool wastl = false;
int iter = 0;
bool istl() {
	if (wastl) {
		return true;
	}
	++iter;
	return wastl = clock() > 3.5L * CLOCKS_PER_SEC;
}
}

ll min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int st, int fi) {
	using namespace my;
	for (int i = 0; i < (int)y.size(); ++i) {
		int lst = -1, lv = -1;
		for (int j = l[i]; j <= r[i]; ++j) {
			if (h[j] < y[i]) {
				continue;
			}
			int v = ff++;
			ys[j].emplace_back(y[i], v);
			if (lst != -1) {
				edge(v, lv, abs(x[lst] - x[j]));
			}
			lst = j;
			lv = v;
		}
	}
	for (int i = 0; i < (int)x.size(); ++i) {
		ground[i] = ff++;
		sort(all(ys[i]));
		int ly = 0, lv = ground[i];
		for (auto cur : ys[i]) {
			edge(cur.y, lv, abs(cur.x - ly));
			tie(ly, lv) = cur;
		}
	}

	int from = ground[st], to = ground[fi];
	fill_n(dst, N, INF);
	dst[from] = 0;
	q.emplace(dst[from], from);
	while (q.size() && !istl()) {
		ll d, w;
		int v, u;
		tie(d, v) = q.top(); q.pop();
		if (d != dst[v]) {
			continue;
		}
		if (v == to) {
			break;
		}
		for (auto e : g[v]) {
			u = e.x, w = e.y;
			if (dst[u] > dst[v] + w) {
				dst[u] = dst[v] + w;
				q.emplace(dst[u], u);
			}
		}
	}
	if (dst[to] > INF / 2) {
		return -1;
	}
	return dst[to];
}

#ifdef LC
#include "grader.cpp"
#endif

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 109764 KB Output is correct
2 Correct 58 ms 109764 KB Output is correct
3 Correct 59 ms 109752 KB Output is correct
4 Correct 58 ms 109780 KB Output is correct
5 Correct 58 ms 109808 KB Output is correct
6 Correct 59 ms 109844 KB Output is correct
7 Correct 58 ms 109796 KB Output is correct
8 Correct 58 ms 109896 KB Output is correct
9 Correct 60 ms 109764 KB Output is correct
10 Correct 59 ms 109896 KB Output is correct
11 Correct 60 ms 109836 KB Output is correct
12 Correct 60 ms 109816 KB Output is correct
13 Correct 61 ms 109768 KB Output is correct
14 Correct 59 ms 109824 KB Output is correct
15 Correct 59 ms 109808 KB Output is correct
16 Correct 60 ms 109812 KB Output is correct
17 Correct 58 ms 109900 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 109808 KB Output is correct
2 Correct 61 ms 109804 KB Output is correct
3 Correct 434 ms 156756 KB Output is correct
4 Correct 1000 ms 162428 KB Output is correct
5 Correct 465 ms 155616 KB Output is correct
6 Correct 1160 ms 150740 KB Output is correct
7 Correct 471 ms 155660 KB Output is correct
8 Correct 616 ms 168644 KB Output is correct
9 Correct 512 ms 154976 KB Output is correct
10 Correct 1291 ms 180908 KB Output is correct
11 Correct 358 ms 136900 KB Output is correct
12 Correct 377 ms 128296 KB Output is correct
13 Correct 1238 ms 174184 KB Output is correct
14 Execution timed out 4041 ms 127668 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 118564 KB Output is correct
2 Runtime error 479 ms 370292 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 176 ms 118564 KB Output is correct
2 Runtime error 479 ms 370292 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 109764 KB Output is correct
2 Correct 58 ms 109764 KB Output is correct
3 Correct 59 ms 109752 KB Output is correct
4 Correct 58 ms 109780 KB Output is correct
5 Correct 58 ms 109808 KB Output is correct
6 Correct 59 ms 109844 KB Output is correct
7 Correct 58 ms 109796 KB Output is correct
8 Correct 58 ms 109896 KB Output is correct
9 Correct 60 ms 109764 KB Output is correct
10 Correct 59 ms 109896 KB Output is correct
11 Correct 60 ms 109836 KB Output is correct
12 Correct 60 ms 109816 KB Output is correct
13 Correct 61 ms 109768 KB Output is correct
14 Correct 59 ms 109824 KB Output is correct
15 Correct 59 ms 109808 KB Output is correct
16 Correct 60 ms 109812 KB Output is correct
17 Correct 58 ms 109900 KB Output is correct
18 Correct 59 ms 109808 KB Output is correct
19 Correct 61 ms 109804 KB Output is correct
20 Correct 434 ms 156756 KB Output is correct
21 Correct 1000 ms 162428 KB Output is correct
22 Correct 465 ms 155616 KB Output is correct
23 Correct 1160 ms 150740 KB Output is correct
24 Correct 471 ms 155660 KB Output is correct
25 Correct 616 ms 168644 KB Output is correct
26 Correct 512 ms 154976 KB Output is correct
27 Correct 1291 ms 180908 KB Output is correct
28 Correct 358 ms 136900 KB Output is correct
29 Correct 377 ms 128296 KB Output is correct
30 Correct 1238 ms 174184 KB Output is correct
31 Execution timed out 4041 ms 127668 KB Time limit exceeded
32 Halted 0 ms 0 KB -