oj.uz

Submission #341812

# Submission time Handle Problem Language Result Execution time Memory
341812 2020-12-31T05:39:42 Z egod1537 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 36076 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> inpos[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;
		inpos[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<pi>& nV = V[now.pos];

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

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

			nV.insert({ j, dst / now.range });
			if (inpos[j].find(now.range) != inpos[j].end()) break;
		}
	}

	vector<int> vit(n, -1);

	int num = 0;
	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 (vit[w.to] == num) continue;
			if (dst[w.to] > top.cost + w.cost) {
				dst[w.to] = top.cost + w.cost;
				pq.push({ w.to, dst[w.to] });
			}
			vit[w.to] = num;
		}

		num++;
	}

	cout << -1;

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 3 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 4 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 3 ms 3436 KB Output is correct
15 Correct 4 ms 3436 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3308 KB Output is correct
2 Correct 2 ms 3308 KB Output is correct
3 Correct 3 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 3 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 4 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 4 ms 3436 KB Output is correct
15 Correct 3 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 5 ms 4076 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3308 KB Output is correct
20 Correct 3 ms 3564 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 4 ms 3692 KB Output is correct
25 Correct 4 ms 3692 KB Output is correct
26 Correct 12 ms 3308 KB Output is correct
27 Correct 10 ms 3308 KB Output is correct
28 Correct 6 ms 4332 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 3308 KB Output is correct
33 Correct 4 ms 3436 KB Output is correct
34 Correct 4 ms 3436 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory 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 3 ms 3308 KB Output is correct
9 Correct 3 ms 3308 KB Output is correct
10 Correct 3 ms 3308 KB Output is correct
11 Correct 4 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 3 ms 3436 KB Output is correct
16 Correct 4 ms 3436 KB Output is correct
17 Correct 5 ms 4076 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3436 KB Output is correct
20 Correct 3 ms 3564 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 4 ms 3692 KB Output is correct
25 Correct 4 ms 3692 KB Output is correct
26 Correct 11 ms 3308 KB Output is correct
27 Correct 10 ms 3308 KB Output is correct
28 Correct 6 ms 4332 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 2 ms 3308 KB Output is correct
33 Correct 4 ms 3436 KB Output is correct
34 Correct 4 ms 3436 KB Output is correct
35 Correct 36 ms 8812 KB Output is correct
36 Correct 7 ms 4204 KB Output is correct
37 Correct 55 ms 12524 KB Output is correct
38 Correct 59 ms 11756 KB Output is correct
39 Correct 51 ms 11884 KB Output is correct
40 Correct 51 ms 11904 KB Output is correct
41 Correct 53 ms 11884 KB Output is correct
42 Correct 151 ms 3692 KB Output is correct
43 Correct 126 ms 3564 KB Output is correct
44 Correct 9 ms 3820 KB Output is correct
45 Correct 27 ms 6252 KB Output is correct
46 Correct 27 ms 6252 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory 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 4 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 4 ms 3436 KB Output is correct
15 Correct 3 ms 3436 KB Output is correct
16 Correct 3 ms 3436 KB Output is correct
17 Correct 5 ms 4076 KB Output is correct
18 Correct 3 ms 3436 KB Output is correct
19 Correct 3 ms 3308 KB Output is correct
20 Correct 3 ms 3564 KB Output is correct
21 Correct 3 ms 3436 KB Output is correct
22 Correct 3 ms 3436 KB Output is correct
23 Correct 3 ms 3436 KB Output is correct
24 Correct 4 ms 3692 KB Output is correct
25 Correct 4 ms 3692 KB Output is correct
26 Correct 11 ms 3308 KB Output is correct
27 Correct 10 ms 3308 KB Output is correct
28 Correct 6 ms 4332 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 3308 KB Output is correct
33 Correct 4 ms 3436 KB Output is correct
34 Correct 4 ms 3436 KB Output is correct
35 Correct 37 ms 8812 KB Output is correct
36 Correct 6 ms 4204 KB Output is correct
37 Correct 52 ms 12524 KB Output is correct
38 Correct 54 ms 11756 KB Output is correct
39 Correct 51 ms 11884 KB Output is correct
40 Correct 51 ms 11884 KB Output is correct
41 Correct 55 ms 11896 KB Output is correct
42 Correct 150 ms 3712 KB Output is correct
43 Correct 126 ms 3564 KB Output is correct
44 Correct 9 ms 3820 KB Output is correct
45 Correct 26 ms 6252 KB Output is correct
46 Correct 27 ms 6252 KB Output is correct
47 Correct 151 ms 36076 KB Output is correct
48 Correct 37 ms 10860 KB Output is correct
49 Correct 26 ms 7916 KB Output is correct
50 Correct 18 ms 6764 KB Output is correct
51 Correct 60 ms 14696 KB Output is correct
52 Correct 67 ms 16108 KB Output is correct
53 Correct 29 ms 8044 KB Output is correct
54 Correct 3 ms 3564 KB Output is correct
55 Correct 3 ms 3564 KB Output is correct
56 Correct 21 ms 7916 KB Output is correct
57 Correct 15 ms 6396 KB Output is correct
58 Execution timed out 1093 ms 3564 KB Time limit exceeded
59 Halted 0 ms 0 KB -