oj.uz

답안 #341810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341810 2020-12-31T05:35:30 Z egod1537 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 21612 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];
set<int> con[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);
	vector<int> posdoge(n + 1, -1);

	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);
	}
	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<int>& ncon = con[now.pos];
		set<pi>& nV = V[now.pos];

		for (int j = now.pos + now.range; j < n; j += now.range) {
			if (ncon.find(j) != ncon.end() || vit[j].size() == 0) continue;
			int dst = j - now.pos;

			nV.insert({ j, dst / now.range });
			ncon.insert(j);
			if (vit[j].find(now.range) != vit[j].end()) break;
		}
		for (int j = now.pos - now.range; j >= 0; j -= now.range) {
			if (ncon.find(j) != ncon.end() || vit[j].size() == 0) continue;
			int dst = now.pos - j;

			nV.insert({ j, dst / now.range });
			ncon.insert(j);
			if (vit[j].find(now.range) != vit[j].end()) 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 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 3 ms 4716 KB Output is correct
7 Correct 4 ms 4716 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4716 KB Output is correct
2 Correct 4 ms 4740 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 3 ms 4716 KB Output is correct
7 Correct 3 ms 4716 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 4 ms 4864 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 5 ms 4716 KB Output is correct
13 Correct 6 ms 4716 KB Output is correct
14 Correct 5 ms 4864 KB Output is correct
15 Correct 5 ms 4844 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 4 ms 4716 KB Output is correct
5 Correct 4 ms 4716 KB Output is correct
6 Correct 3 ms 4716 KB Output is correct
7 Correct 3 ms 4716 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 4 ms 4716 KB Output is correct
10 Correct 4 ms 4844 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 5 ms 4716 KB Output is correct
13 Correct 6 ms 4716 KB Output is correct
14 Correct 4 ms 4844 KB Output is correct
15 Correct 5 ms 4844 KB Output is correct
16 Correct 5 ms 5100 KB Output is correct
17 Correct 8 ms 5996 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct
19 Correct 4 ms 4844 KB Output is correct
20 Correct 5 ms 5228 KB Output is correct
21 Correct 4 ms 4844 KB Output is correct
22 Correct 4 ms 4844 KB Output is correct
23 Correct 5 ms 4972 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5228 KB Output is correct
26 Correct 38 ms 4716 KB Output is correct
27 Correct 30 ms 4716 KB Output is correct
28 Correct 10 ms 6764 KB Output is correct
29 Correct 4 ms 4716 KB Output is correct
30 Correct 3 ms 4716 KB Output is correct
31 Correct 4 ms 4716 KB Output is correct
32 Correct 4 ms 4716 KB Output is correct
33 Correct 5 ms 4844 KB Output is correct
34 Correct 5 ms 4992 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 4 ms 4716 KB Output is correct
7 Correct 3 ms 4716 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 4 ms 4844 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 5 ms 4716 KB Output is correct
13 Correct 6 ms 4716 KB Output is correct
14 Correct 5 ms 4844 KB Output is correct
15 Correct 5 ms 4972 KB Output is correct
16 Correct 5 ms 5120 KB Output is correct
17 Correct 9 ms 5996 KB Output is correct
18 Correct 5 ms 4972 KB Output is correct
19 Correct 4 ms 4844 KB Output is correct
20 Correct 5 ms 5228 KB Output is correct
21 Correct 4 ms 4844 KB Output is correct
22 Correct 4 ms 4844 KB Output is correct
23 Correct 5 ms 4972 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5248 KB Output is correct
26 Correct 38 ms 4716 KB Output is correct
27 Correct 30 ms 4716 KB Output is correct
28 Correct 10 ms 6764 KB Output is correct
29 Correct 5 ms 4716 KB Output is correct
30 Correct 4 ms 4716 KB Output is correct
31 Correct 4 ms 4716 KB Output is correct
32 Correct 4 ms 4716 KB Output is correct
33 Correct 5 ms 4844 KB Output is correct
34 Correct 5 ms 4844 KB Output is correct
35 Correct 57 ms 14188 KB Output is correct
36 Correct 10 ms 6252 KB Output is correct
37 Correct 93 ms 21612 KB Output is correct
38 Correct 87 ms 19692 KB Output is correct
39 Correct 88 ms 20076 KB Output is correct
40 Correct 85 ms 19948 KB Output is correct
41 Correct 85 ms 19820 KB Output is correct
42 Correct 568 ms 4972 KB Output is correct
43 Correct 461 ms 4972 KB Output is correct
44 Execution timed out 1037 ms 5612 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4716 KB Output is correct
2 Correct 3 ms 4716 KB Output is correct
3 Correct 4 ms 4716 KB Output is correct
4 Correct 3 ms 4716 KB Output is correct
5 Correct 3 ms 4716 KB Output is correct
6 Correct 3 ms 4716 KB Output is correct
7 Correct 4 ms 4716 KB Output is correct
8 Correct 3 ms 4716 KB Output is correct
9 Correct 3 ms 4716 KB Output is correct
10 Correct 4 ms 4844 KB Output is correct
11 Correct 5 ms 5100 KB Output is correct
12 Correct 4 ms 4716 KB Output is correct
13 Correct 6 ms 4716 KB Output is correct
14 Correct 4 ms 4844 KB Output is correct
15 Correct 5 ms 4844 KB Output is correct
16 Correct 5 ms 4972 KB Output is correct
17 Correct 8 ms 5996 KB Output is correct
18 Correct 4 ms 4972 KB Output is correct
19 Correct 4 ms 4844 KB Output is correct
20 Correct 5 ms 5228 KB Output is correct
21 Correct 4 ms 4844 KB Output is correct
22 Correct 4 ms 4844 KB Output is correct
23 Correct 5 ms 4972 KB Output is correct
24 Correct 6 ms 5484 KB Output is correct
25 Correct 6 ms 5228 KB Output is correct
26 Correct 39 ms 4716 KB Output is correct
27 Correct 32 ms 4716 KB Output is correct
28 Correct 11 ms 6764 KB Output is correct
29 Correct 5 ms 4716 KB Output is correct
30 Correct 4 ms 4716 KB Output is correct
31 Correct 4 ms 4716 KB Output is correct
32 Correct 4 ms 4716 KB Output is correct
33 Correct 6 ms 4844 KB Output is correct
34 Correct 5 ms 4844 KB Output is correct
35 Correct 56 ms 14060 KB Output is correct
36 Correct 10 ms 6252 KB Output is correct
37 Correct 93 ms 21612 KB Output is correct
38 Correct 92 ms 19692 KB Output is correct
39 Correct 91 ms 19948 KB Output is correct
40 Correct 88 ms 19948 KB Output is correct
41 Correct 89 ms 19820 KB Output is correct
42 Correct 572 ms 4972 KB Output is correct
43 Correct 465 ms 5136 KB Output is correct
44 Execution timed out 1097 ms 5612 KB Time limit exceeded
45 Halted 0 ms 0 KB -