oj.uz

Submission #341821

# Submission time Handle Problem Language Result Execution time Memory
341821 2020-12-31T06:20:49 Z egod1537 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 22124 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];
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];
		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 3948 KB Output is correct
2 Correct 3 ms 3948 KB Output is correct
3 Correct 3 ms 3948 KB Output is correct
4 Correct 3 ms 3948 KB Output is correct
5 Correct 3 ms 3948 KB Output is correct
6 Correct 3 ms 3948 KB Output is correct
7 Correct 3 ms 3948 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3948 KB Output is correct
2 Correct 3 ms 3948 KB Output is correct
3 Correct 3 ms 3948 KB Output is correct
4 Correct 3 ms 3948 KB Output is correct
5 Correct 3 ms 3948 KB Output is correct
6 Correct 3 ms 3948 KB Output is correct
7 Correct 3 ms 3948 KB Output is correct
8 Correct 3 ms 3948 KB Output is correct
9 Correct 3 ms 3948 KB Output is correct
10 Correct 3 ms 4076 KB Output is correct
11 Correct 5 ms 4332 KB Output is correct
12 Correct 4 ms 3948 KB Output is correct
13 Correct 5 ms 3948 KB Output is correct
14 Correct 4 ms 4204 KB Output is correct
15 Correct 4 ms 4204 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3948 KB Output is correct
2 Correct 3 ms 3948 KB Output is correct
3 Correct 3 ms 3948 KB Output is correct
4 Correct 3 ms 3948 KB Output is correct
5 Correct 3 ms 3948 KB Output is correct
6 Correct 3 ms 3948 KB Output is correct
7 Correct 3 ms 3948 KB Output is correct
8 Correct 3 ms 3948 KB Output is correct
9 Correct 3 ms 3948 KB Output is correct
10 Correct 3 ms 4076 KB Output is correct
11 Correct 5 ms 4352 KB Output is correct
12 Correct 5 ms 3948 KB Output is correct
13 Correct 5 ms 3948 KB Output is correct
14 Correct 4 ms 4204 KB Output is correct
15 Correct 4 ms 4204 KB Output is correct
16 Correct 4 ms 4332 KB Output is correct
17 Correct 9 ms 5484 KB Output is correct
18 Correct 4 ms 4332 KB Output is correct
19 Correct 3 ms 4076 KB Output is correct
20 Correct 4 ms 4332 KB Output is correct
21 Correct 4 ms 4204 KB Output is correct
22 Correct 4 ms 4204 KB Output is correct
23 Correct 4 ms 4332 KB Output is correct
24 Correct 6 ms 4844 KB Output is correct
25 Correct 5 ms 4588 KB Output is correct
26 Correct 17 ms 4076 KB Output is correct
27 Correct 16 ms 4076 KB Output is correct
28 Correct 11 ms 6252 KB Output is correct
29 Correct 3 ms 4076 KB Output is correct
30 Correct 3 ms 3968 KB Output is correct
31 Correct 3 ms 4096 KB Output is correct
32 Correct 3 ms 4076 KB Output is correct
33 Correct 5 ms 4332 KB Output is correct
34 Correct 5 ms 4204 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3948 KB Output is correct
2 Correct 3 ms 3948 KB Output is correct
3 Correct 3 ms 3948 KB Output is correct
4 Correct 3 ms 3948 KB Output is correct
5 Correct 3 ms 3948 KB Output is correct
6 Correct 3 ms 3948 KB Output is correct
7 Correct 3 ms 3948 KB Output is correct
8 Correct 3 ms 3948 KB Output is correct
9 Correct 3 ms 3948 KB Output is correct
10 Correct 4 ms 4076 KB Output is correct
11 Correct 5 ms 4332 KB Output is correct
12 Correct 4 ms 3948 KB Output is correct
13 Correct 6 ms 3948 KB Output is correct
14 Correct 4 ms 4204 KB Output is correct
15 Correct 4 ms 4204 KB Output is correct
16 Correct 5 ms 4332 KB Output is correct
17 Correct 9 ms 5484 KB Output is correct
18 Correct 4 ms 4332 KB Output is correct
19 Correct 3 ms 4076 KB Output is correct
20 Correct 4 ms 4332 KB Output is correct
21 Correct 4 ms 4204 KB Output is correct
22 Correct 4 ms 4204 KB Output is correct
23 Correct 4 ms 4332 KB Output is correct
24 Correct 6 ms 4844 KB Output is correct
25 Correct 5 ms 4588 KB Output is correct
26 Correct 18 ms 4076 KB Output is correct
27 Correct 15 ms 4076 KB Output is correct
28 Correct 10 ms 6252 KB Output is correct
29 Correct 3 ms 4076 KB Output is correct
30 Correct 3 ms 3948 KB Output is correct
31 Correct 4 ms 4076 KB Output is correct
32 Correct 4 ms 4076 KB Output is correct
33 Correct 4 ms 4204 KB Output is correct
34 Correct 4 ms 4204 KB Output is correct
35 Correct 73 ms 13932 KB Output is correct
36 Correct 10 ms 5740 KB Output is correct
37 Correct 151 ms 22124 KB Output is correct
38 Correct 130 ms 20076 KB Output is correct
39 Correct 156 ms 20332 KB Output is correct
40 Correct 136 ms 20204 KB Output is correct
41 Correct 135 ms 20204 KB Output is correct
42 Correct 228 ms 4332 KB Output is correct
43 Correct 217 ms 4204 KB Output is correct
44 Execution timed out 1080 ms 4844 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3948 KB Output is correct
2 Correct 3 ms 3948 KB Output is correct
3 Correct 3 ms 3948 KB Output is correct
4 Correct 3 ms 3948 KB Output is correct
5 Correct 3 ms 3948 KB Output is correct
6 Correct 3 ms 3948 KB Output is correct
7 Correct 3 ms 3948 KB Output is correct
8 Correct 3 ms 3948 KB Output is correct
9 Correct 3 ms 3948 KB Output is correct
10 Correct 4 ms 4076 KB Output is correct
11 Correct 5 ms 4332 KB Output is correct
12 Correct 4 ms 3948 KB Output is correct
13 Correct 5 ms 3948 KB Output is correct
14 Correct 4 ms 4204 KB Output is correct
15 Correct 4 ms 4204 KB Output is correct
16 Correct 4 ms 4332 KB Output is correct
17 Correct 8 ms 5484 KB Output is correct
18 Correct 4 ms 4332 KB Output is correct
19 Correct 3 ms 4076 KB Output is correct
20 Correct 4 ms 4332 KB Output is correct
21 Correct 4 ms 4204 KB Output is correct
22 Correct 4 ms 4204 KB Output is correct
23 Correct 4 ms 4332 KB Output is correct
24 Correct 6 ms 4844 KB Output is correct
25 Correct 5 ms 4588 KB Output is correct
26 Correct 17 ms 4076 KB Output is correct
27 Correct 16 ms 4076 KB Output is correct
28 Correct 10 ms 6252 KB Output is correct
29 Correct 4 ms 4076 KB Output is correct
30 Correct 3 ms 3948 KB Output is correct
31 Correct 3 ms 4076 KB Output is correct
32 Correct 3 ms 4076 KB Output is correct
33 Correct 4 ms 4204 KB Output is correct
34 Correct 4 ms 4204 KB Output is correct
35 Correct 72 ms 13932 KB Output is correct
36 Correct 10 ms 5740 KB Output is correct
37 Correct 150 ms 21996 KB Output is correct
38 Correct 133 ms 20076 KB Output is correct
39 Correct 134 ms 20332 KB Output is correct
40 Correct 134 ms 20204 KB Output is correct
41 Correct 131 ms 20204 KB Output is correct
42 Correct 231 ms 4332 KB Output is correct
43 Correct 215 ms 4204 KB Output is correct
44 Execution timed out 1092 ms 4716 KB Time limit exceeded
45 Halted 0 ms 0 KB -