oj.uz

답안 #417280

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
417280 2021-06-03T14:19:25 Z Mlxa Sky Walking (IOI19_walk) C++14
10 / 100
 620 ms 370356 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() > 0.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 59 ms 109764 KB Output is correct
2 Correct 61 ms 109876 KB Output is correct
3 Correct 65 ms 109868 KB Output is correct
4 Correct 58 ms 109812 KB Output is correct
5 Correct 57 ms 109892 KB Output is correct
6 Correct 57 ms 109912 KB Output is correct
7 Correct 58 ms 109908 KB Output is correct
8 Correct 58 ms 109880 KB Output is correct
9 Correct 59 ms 109804 KB Output is correct
10 Correct 61 ms 109876 KB Output is correct
11 Correct 59 ms 109836 KB Output is correct
12 Correct 62 ms 109764 KB Output is correct
13 Correct 60 ms 109872 KB Output is correct
14 Correct 58 ms 109824 KB Output is correct
15 Correct 62 ms 109868 KB Output is correct
16 Correct 60 ms 109796 KB Output is correct
17 Correct 68 ms 109816 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 109852 KB Output is correct
2 Correct 64 ms 109776 KB Output is correct
3 Correct 410 ms 156716 KB Output is correct
4 Incorrect 620 ms 162416 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 118696 KB Output is correct
2 Runtime error 478 ms 370356 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 118696 KB Output is correct
2 Runtime error 478 ms 370356 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 109764 KB Output is correct
2 Correct 61 ms 109876 KB Output is correct
3 Correct 65 ms 109868 KB Output is correct
4 Correct 58 ms 109812 KB Output is correct
5 Correct 57 ms 109892 KB Output is correct
6 Correct 57 ms 109912 KB Output is correct
7 Correct 58 ms 109908 KB Output is correct
8 Correct 58 ms 109880 KB Output is correct
9 Correct 59 ms 109804 KB Output is correct
10 Correct 61 ms 109876 KB Output is correct
11 Correct 59 ms 109836 KB Output is correct
12 Correct 62 ms 109764 KB Output is correct
13 Correct 60 ms 109872 KB Output is correct
14 Correct 58 ms 109824 KB Output is correct
15 Correct 62 ms 109868 KB Output is correct
16 Correct 60 ms 109796 KB Output is correct
17 Correct 68 ms 109816 KB Output is correct
18 Correct 59 ms 109852 KB Output is correct
19 Correct 64 ms 109776 KB Output is correct
20 Correct 410 ms 156716 KB Output is correct
21 Incorrect 620 ms 162416 KB Output isn't correct
22 Halted 0 ms 0 KB -