oj.uz

Submission #341819

# Submission time Handle Problem Language Result Execution time Memory
341819 2020-12-31T06:19:22 Z egod1537 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 68972 KB 
#include <bits/stdc++.h>
#include <unordered_map>

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;
}

vector<pi> V[30001];
unordered_map<int, bool> vit[30001], 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][doge[i].range] = true;
	}
	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];
		unordered_map<int, bool>& ncon = con[now.pos];
		vector<pi>& nV = V[now.pos];

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

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

			nV.push_back({ j, dst / now.range });
			ncon[j] = true;
			if (vit[j][now.range]) 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4460 KB Output is correct
2 Correct 3 ms 4460 KB Output is correct
3 Correct 3 ms 4460 KB Output is correct
4 Correct 3 ms 4460 KB Output is correct
5 Correct 3 ms 4460 KB Output is correct
6 Correct 3 ms 4460 KB Output is correct
7 Correct 3 ms 4460 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4460 KB Output is correct
2 Correct 3 ms 4460 KB Output is correct
3 Correct 3 ms 4460 KB Output is correct
4 Correct 4 ms 4588 KB Output is correct
5 Correct 3 ms 4460 KB Output is correct
6 Correct 4 ms 4460 KB Output is correct
7 Correct 3 ms 4460 KB Output is correct
8 Correct 4 ms 4460 KB Output is correct
9 Correct 3 ms 4460 KB Output is correct
10 Correct 4 ms 4608 KB Output is correct
11 Correct 5 ms 4856 KB Output is correct
12 Correct 4 ms 4460 KB Output is correct
13 Correct 5 ms 4460 KB Output is correct
14 Correct 4 ms 4716 KB Output is correct
15 Correct 4 ms 4716 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4460 KB Output is correct
2 Correct 3 ms 4460 KB Output is correct
3 Correct 4 ms 4460 KB Output is correct
4 Correct 3 ms 4460 KB Output is correct
5 Correct 3 ms 4460 KB Output is correct
6 Correct 3 ms 4460 KB Output is correct
7 Correct 3 ms 4460 KB Output is correct
8 Correct 3 ms 4460 KB Output is correct
9 Correct 3 ms 4460 KB Output is correct
10 Correct 4 ms 4588 KB Output is correct
11 Correct 5 ms 4844 KB Output is correct
12 Correct 5 ms 4460 KB Output is correct
13 Correct 5 ms 4460 KB Output is correct
14 Correct 4 ms 4716 KB Output is correct
15 Correct 4 ms 4716 KB Output is correct
16 Correct 5 ms 4844 KB Output is correct
17 Correct 8 ms 5740 KB Output is correct
18 Correct 5 ms 4716 KB Output is correct
19 Correct 4 ms 4588 KB Output is correct
20 Correct 5 ms 4844 KB Output is correct
21 Correct 4 ms 4588 KB Output is correct
22 Correct 5 ms 4716 KB Output is correct
23 Correct 5 ms 4716 KB Output is correct
24 Correct 7 ms 5228 KB Output is correct
25 Correct 6 ms 4972 KB Output is correct
26 Correct 18 ms 4588 KB Output is correct
27 Correct 16 ms 4460 KB Output is correct
28 Correct 14 ms 6636 KB Output is correct
29 Correct 4 ms 4588 KB Output is correct
30 Correct 4 ms 4460 KB Output is correct
31 Correct 4 ms 4460 KB Output is correct
32 Correct 4 ms 4460 KB Output is correct
33 Correct 5 ms 4716 KB Output is correct
34 Correct 5 ms 4716 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4460 KB Output is correct
2 Correct 3 ms 4460 KB Output is correct
3 Correct 4 ms 4460 KB Output is correct
4 Correct 4 ms 4460 KB Output is correct
5 Correct 3 ms 4460 KB Output is correct
6 Correct 3 ms 4460 KB Output is correct
7 Correct 3 ms 4460 KB Output is correct
8 Correct 3 ms 4460 KB Output is correct
9 Correct 3 ms 4460 KB Output is correct
10 Correct 4 ms 4588 KB Output is correct
11 Correct 5 ms 4844 KB Output is correct
12 Correct 4 ms 4460 KB Output is correct
13 Correct 5 ms 4460 KB Output is correct
14 Correct 4 ms 4716 KB Output is correct
15 Correct 5 ms 4716 KB Output is correct
16 Correct 5 ms 4844 KB Output is correct
17 Correct 9 ms 5740 KB Output is correct
18 Correct 5 ms 4724 KB Output is correct
19 Correct 4 ms 4588 KB Output is correct
20 Correct 5 ms 4844 KB Output is correct
21 Correct 4 ms 4588 KB Output is correct
22 Correct 5 ms 4716 KB Output is correct
23 Correct 5 ms 4716 KB Output is correct
24 Correct 7 ms 5228 KB Output is correct
25 Correct 6 ms 4972 KB Output is correct
26 Correct 17 ms 4460 KB Output is correct
27 Correct 16 ms 4460 KB Output is correct
28 Correct 11 ms 6636 KB Output is correct
29 Correct 4 ms 4588 KB Output is correct
30 Correct 4 ms 4460 KB Output is correct
31 Correct 4 ms 4460 KB Output is correct
32 Correct 4 ms 4460 KB Output is correct
33 Correct 5 ms 4716 KB Output is correct
34 Correct 5 ms 4716 KB Output is correct
35 Correct 59 ms 13676 KB Output is correct
36 Correct 10 ms 6016 KB Output is correct
37 Correct 143 ms 20844 KB Output is correct
38 Correct 108 ms 19052 KB Output is correct
39 Correct 114 ms 19308 KB Output is correct
40 Correct 110 ms 19180 KB Output is correct
41 Correct 127 ms 19180 KB Output is correct
42 Correct 231 ms 4844 KB Output is correct
43 Correct 213 ms 4716 KB Output is correct
44 Correct 485 ms 5228 KB Output is correct
45 Correct 24 ms 7532 KB Output is correct
46 Correct 23 ms 7532 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4460 KB Output is correct
2 Correct 3 ms 4460 KB Output is correct
3 Correct 3 ms 4460 KB Output is correct
4 Correct 3 ms 4460 KB Output is correct
5 Correct 3 ms 4460 KB Output is correct
6 Correct 3 ms 4460 KB Output is correct
7 Correct 3 ms 4460 KB Output is correct
8 Correct 3 ms 4460 KB Output is correct
9 Correct 4 ms 4460 KB Output is correct
10 Correct 4 ms 4588 KB Output is correct
11 Correct 6 ms 4844 KB Output is correct
12 Correct 4 ms 4460 KB Output is correct
13 Correct 6 ms 4460 KB Output is correct
14 Correct 5 ms 4716 KB Output is correct
15 Correct 4 ms 4716 KB Output is correct
16 Correct 5 ms 4844 KB Output is correct
17 Correct 8 ms 5740 KB Output is correct
18 Correct 5 ms 4716 KB Output is correct
19 Correct 4 ms 4588 KB Output is correct
20 Correct 5 ms 4844 KB Output is correct
21 Correct 4 ms 4588 KB Output is correct
22 Correct 5 ms 4716 KB Output is correct
23 Correct 5 ms 4716 KB Output is correct
24 Correct 7 ms 5228 KB Output is correct
25 Correct 7 ms 4972 KB Output is correct
26 Correct 17 ms 4460 KB Output is correct
27 Correct 16 ms 4460 KB Output is correct
28 Correct 11 ms 6636 KB Output is correct
29 Correct 4 ms 4588 KB Output is correct
30 Correct 5 ms 4460 KB Output is correct
31 Correct 4 ms 4460 KB Output is correct
32 Correct 4 ms 4460 KB Output is correct
33 Correct 5 ms 4716 KB Output is correct
34 Correct 5 ms 4716 KB Output is correct
35 Correct 65 ms 13676 KB Output is correct
36 Correct 10 ms 5996 KB Output is correct
37 Correct 145 ms 20844 KB Output is correct
38 Correct 106 ms 19052 KB Output is correct
39 Correct 107 ms 19180 KB Output is correct
40 Correct 108 ms 19180 KB Output is correct
41 Correct 125 ms 19180 KB Output is correct
42 Correct 226 ms 4716 KB Output is correct
43 Correct 215 ms 4716 KB Output is correct
44 Correct 503 ms 5228 KB Output is correct
45 Correct 30 ms 7532 KB Output is correct
46 Correct 24 ms 7532 KB Output is correct
47 Correct 710 ms 68972 KB Output is correct
48 Correct 126 ms 18796 KB Output is correct
49 Correct 63 ms 12652 KB Output is correct
50 Correct 46 ms 10732 KB Output is correct
51 Correct 200 ms 25064 KB Output is correct
52 Correct 214 ms 27660 KB Output is correct
53 Correct 45 ms 11044 KB Output is correct
54 Correct 4 ms 4588 KB Output is correct
55 Correct 4 ms 4588 KB Output is correct
56 Correct 34 ms 10476 KB Output is correct
57 Correct 30 ms 9068 KB Output is correct
58 Execution timed out 1087 ms 4844 KB Time limit exceeded
59 Halted 0 ms 0 KB -