oj.uz

답안 #341816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341816 2020-12-31T06:08:48 Z egod1537 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 12652 KB 
#include <bits/stdc++.h>

using namespace std;

const int INF = 0x3f3f3f3f;

typedef pair<int, int> pi;
#define to first
#define cost second
#define pos first
#define range second

struct Q {
	int pos, cost;
};
bool operator<(const Q& a, const Q& b) {
	return a.cost > b.cost;
}

set<pi> V[30001];
set<int> vit[30001];
int dst[30001];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	memset(dst, INF, sizeof(dst));

	int n, m; cin >> n >> m;
	vector<pi> doge(m);

	set<int> sx;
	int s = 0, e = 0;
	for (int i = 0; i < m; i++) {
		cin >> doge[i].pos >> doge[i].range;
		if (i == 0) s = doge[i].pos;
		if (i == 1) e = doge[i].pos;
		vit[doge[i].pos].insert(doge[i].range);
		sx.insert(doge[i].pos);
	}
	sort(doge.begin(), doge.end(), [](pi& a, pi& b) -> bool {
		if (a.range != b.range) return a.range > b.range;
		return a.pos < b.pos;
		});

	for (int i = 0; i < m; i++) {
		pi& now = doge[i];
		set<pi>& nV = V[now.pos];

		auto itr = sx.find(now.pos);
		if (itr != sx.end() && next(itr) != sx.end()) {
			for (++itr; itr != sx.end(); itr++) {
				int x = *itr;

				int dst = x - now.pos;
				if (dst % now.range || vit[x].size() == 0) continue;

				nV.insert({ x, dst / now.range });
				if (vit[x].find(now.range) != vit[x].end()) break;
			}
		}
		itr = sx.find(now.pos);
		if (itr != sx.begin()) {
			for (--itr; ; itr--) {
				int x = *itr;

				int dst = now.pos - x;
				if (dst % now.range || vit[x].size() == 0) {
					if (itr == sx.begin()) break;
					else continue;
				}

				nV.insert({ x, dst / now.range });
				if (vit[x].find(now.range) != vit[x].end()) break;
				if (itr == sx.begin()) break;
			}
		}
	}

	priority_queue<Q> pq;
	pq.push({ s, 0 });
	while (!pq.empty()) {
		Q top = pq.top(); pq.pop();

		if (top.pos == e) {
			cout << top.cost;
			return 0;
		}

		for (pi w : V[top.pos]) {
			if (dst[w.to] > top.cost + w.cost) {
				dst[w.to] = top.cost + w.cost;
				pq.push({ w.to, dst[w.to] });
			}
		}
	}

	cout << -1;

	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 2 ms 3308 KB Output is correct
5 Correct 2 ms 3308 KB Output is correct
6 Correct 2 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 3 ms 3328 KB Output is correct
4 Correct 2 ms 3308 KB Output is correct
5 Correct 3 ms 3308 KB Output is correct
6 Correct 2 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct
8 Correct 2 ms 3328 KB Output is correct
9 Correct 2 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 7 ms 3564 KB Output is correct
12 Correct 3 ms 3308 KB Output is correct
13 Correct 3 ms 3308 KB Output is correct
14 Correct 5 ms 3436 KB Output is correct
15 Correct 5 ms 3436 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 2 ms 3308 KB Output is correct
5 Correct 2 ms 3308 KB Output is correct
6 Correct 2 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct
8 Correct 2 ms 3308 KB Output is correct
9 Correct 2 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 6 ms 3564 KB Output is correct
12 Correct 3 ms 3308 KB Output is correct
13 Correct 3 ms 3308 KB Output is correct
14 Correct 5 ms 3436 KB Output is correct
15 Correct 5 ms 3436 KB Output is correct
16 Correct 5 ms 3436 KB Output is correct
17 Correct 19 ms 4076 KB Output is correct
18 Correct 12 ms 3456 KB Output is correct
19 Correct 6 ms 3308 KB Output is correct
20 Correct 4 ms 3692 KB Output is correct
21 Correct 7 ms 3436 KB Output is correct
22 Correct 7 ms 3436 KB Output is correct
23 Correct 11 ms 3436 KB Output is correct
24 Correct 31 ms 3776 KB Output is correct
25 Correct 33 ms 3692 KB Output is correct
26 Correct 7 ms 3308 KB Output is correct
27 Correct 7 ms 3308 KB Output is correct
28 Correct 55 ms 4460 KB Output is correct
29 Correct 3 ms 3308 KB Output is correct
30 Correct 3 ms 3308 KB Output is correct
31 Correct 3 ms 3308 KB Output is correct
32 Correct 3 ms 3308 KB Output is correct
33 Correct 5 ms 3436 KB Output is correct
34 Correct 5 ms 3436 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 2 ms 3308 KB Output is correct
5 Correct 2 ms 3308 KB Output is correct
6 Correct 2 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct
8 Correct 2 ms 3308 KB Output is correct
9 Correct 2 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 6 ms 3564 KB Output is correct
12 Correct 3 ms 3308 KB Output is correct
13 Correct 3 ms 3308 KB Output is correct
14 Correct 5 ms 3436 KB Output is correct
15 Correct 5 ms 3436 KB Output is correct
16 Correct 5 ms 3436 KB Output is correct
17 Correct 19 ms 4076 KB Output is correct
18 Correct 14 ms 3436 KB Output is correct
19 Correct 6 ms 3308 KB Output is correct
20 Correct 4 ms 3692 KB Output is correct
21 Correct 7 ms 3436 KB Output is correct
22 Correct 8 ms 3436 KB Output is correct
23 Correct 11 ms 3456 KB Output is correct
24 Correct 30 ms 3820 KB Output is correct
25 Correct 34 ms 3692 KB Output is correct
26 Correct 7 ms 3328 KB Output is correct
27 Correct 6 ms 3308 KB Output is correct
28 Correct 55 ms 4460 KB Output is correct
29 Correct 3 ms 3308 KB Output is correct
30 Correct 2 ms 3308 KB Output is correct
31 Correct 4 ms 3308 KB Output is correct
32 Correct 3 ms 3308 KB Output is correct
33 Correct 5 ms 3436 KB Output is correct
34 Correct 5 ms 3436 KB Output is correct
35 Correct 489 ms 8940 KB Output is correct
36 Correct 65 ms 4204 KB Output is correct
37 Correct 546 ms 12652 KB Output is correct
38 Correct 825 ms 12012 KB Output is correct
39 Correct 855 ms 12012 KB Output is correct
40 Correct 857 ms 12012 KB Output is correct
41 Correct 837 ms 11884 KB Output is correct
42 Correct 75 ms 3564 KB Output is correct
43 Correct 52 ms 3564 KB Output is correct
44 Correct 12 ms 3820 KB Output is correct
45 Correct 93 ms 6252 KB Output is correct
46 Correct 99 ms 6380 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 2 ms 3308 KB Output is correct
4 Correct 2 ms 3308 KB Output is correct
5 Correct 3 ms 3308 KB Output is correct
6 Correct 2 ms 3308 KB Output is correct
7 Correct 2 ms 3308 KB Output is correct
8 Correct 2 ms 3308 KB Output is correct
9 Correct 2 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 6 ms 3564 KB Output is correct
12 Correct 3 ms 3308 KB Output is correct
13 Correct 3 ms 3308 KB Output is correct
14 Correct 6 ms 3500 KB Output is correct
15 Correct 5 ms 3436 KB Output is correct
16 Correct 5 ms 3436 KB Output is correct
17 Correct 19 ms 4076 KB Output is correct
18 Correct 11 ms 3436 KB Output is correct
19 Correct 6 ms 3308 KB Output is correct
20 Correct 4 ms 3692 KB Output is correct
21 Correct 7 ms 3436 KB Output is correct
22 Correct 7 ms 3436 KB Output is correct
23 Correct 11 ms 3436 KB Output is correct
24 Correct 30 ms 3820 KB Output is correct
25 Correct 33 ms 3692 KB Output is correct
26 Correct 7 ms 3308 KB Output is correct
27 Correct 6 ms 3308 KB Output is correct
28 Correct 56 ms 4460 KB Output is correct
29 Correct 3 ms 3308 KB Output is correct
30 Correct 2 ms 3308 KB Output is correct
31 Correct 3 ms 3308 KB Output is correct
32 Correct 3 ms 3436 KB Output is correct
33 Correct 5 ms 3436 KB Output is correct
34 Correct 5 ms 3436 KB Output is correct
35 Correct 483 ms 8812 KB Output is correct
36 Correct 66 ms 4204 KB Output is correct
37 Correct 540 ms 12524 KB Output is correct
38 Correct 839 ms 12012 KB Output is correct
39 Correct 857 ms 12064 KB Output is correct
40 Correct 846 ms 12012 KB Output is correct
41 Correct 833 ms 12012 KB Output is correct
42 Correct 74 ms 3564 KB Output is correct
43 Correct 52 ms 3564 KB Output is correct
44 Correct 11 ms 3820 KB Output is correct
45 Correct 94 ms 6380 KB Output is correct
46 Correct 96 ms 6252 KB Output is correct
47 Execution timed out 1082 ms 6128 KB Time limit exceeded
48 Halted 0 ms 0 KB -