oj.uz

Submission #1026298

# Submission time Handle Problem Language Result Execution time Memory
1026298 2024-07-17T19:22:40 Z xnqs Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 130 ms 45912 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <cstring>
 
int x, d;
int src, dest;
int dist[30005][175];
std::vector<int> dogs_less_than_sqrt[30005];
std::vector<int> dogs_greater_than_sqrt[30005];
 
int bfs(int src, int dest) {
	memset(dist,0x3f,sizeof(dist));
	std::priority_queue<std::tuple<int,int,int>, std::vector<std::tuple<int,int,int>>, std::greater<std::tuple<int,int,int>>> q;
	q.emplace(0,src,0);
	dist[src][0] = 0;
 
	while (!q.empty()) {
		auto [c, k, cap] = q.top();
		q.pop();
 
		// switch dog (<= sqrt)
		if (dist[k][0]>dist[k][cap]) {
			dist[k][0] = dist[k][cap];
			q.emplace(dist[k][0], k, 0);
		}
		for (const auto& i : dogs_less_than_sqrt[k]) {
			if (dist[k][i]>dist[k][cap]) {
				dist[k][i] = dist[k][cap];
				q.emplace(dist[k][i], k, i);
			}
		}
 
		// try to go as far as possible (> sqrt)
		for (const auto& i : dogs_greater_than_sqrt[k]) {
			for (int j = 1; k+j*i < x; j++) {
				if (dist[k+j*i][0]>dist[k][cap]+j) {
					dist[k+j*i][0] = dist[k][cap]+j;
					q.emplace(dist[k+j*i][0], k+j*i, 0);
				}
			}
			for (int j = 1; k-j*i >= 0; j++) {
				if (dist[k-j*i][0]>dist[k][cap]+j) {
					dist[k-j*i][0] = dist[k][cap]+j;
					q.emplace(dist[k+j*i][0], k-j*i, 0);
				}
			}
		}
 
		// use the current dog (<= sqrt)
		if (cap!=0) {
			if (k-cap>=0&&dist[k-cap][cap]>dist[k][cap]+1) {
				dist[k-cap][cap] = dist[k][cap]+1;
				q.emplace(dist[k-cap][cap], k-cap, cap);
			}
			if (k+cap<x&&dist[k+cap][cap]>dist[k][cap]+1) {
				dist[k+cap][cap] = dist[k][cap]+1;
				q.emplace(dist[k+cap][cap], k+cap, cap);
			}
		}
	}
 
	int ret = 0x3f3f3f3f;
	for (int i = 0; i < 175; i++) {
		ret = std::min(ret, dist[dest][i]);
	}
 
	return ((ret==0x3f3f3f3f) ? -1 : ret);
}
 
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);
 
	std::cin >> x >> d;
 
	for (int i = 0, a, b; i < d; i++) {
		std::cin >> a >> b;
		if (i==0) {
			src = a;
		}
		else if (i==1) {
			dest = a;
		}
 
		if (b<=173) {
			dogs_less_than_sqrt[a].emplace_back(b);
		}
		else {
			dogs_greater_than_sqrt[a].emplace_back(b);
		}
	}
 
	for (int i = 0; i < x; i++) {
		std::sort(dogs_less_than_sqrt[i].begin(), dogs_less_than_sqrt[i].end());
		std::sort(dogs_greater_than_sqrt[i].begin(), dogs_greater_than_sqrt[i].end());
		dogs_less_than_sqrt[i].erase(std::unique(dogs_less_than_sqrt[i].begin(), dogs_less_than_sqrt[i].end()),
		                             dogs_less_than_sqrt[i].end());
		dogs_greater_than_sqrt[i].erase(std::unique(dogs_greater_than_sqrt[i].begin(), dogs_greater_than_sqrt[i].end()),
		                             dogs_greater_than_sqrt[i].end());
	}
 
	std::cout << bfs(src,dest) << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22364 KB Output is correct
2 Correct 3 ms 22420 KB Output is correct
3 Correct 3 ms 22364 KB Output is correct
4 Correct 3 ms 22364 KB Output is correct
5 Correct 4 ms 22360 KB Output is correct
6 Correct 3 ms 22364 KB Output is correct
7 Correct 3 ms 22364 KB Output is correct
8 Correct 3 ms 22364 KB Output is correct
9 Correct 3 ms 22360 KB Output is correct
10 Correct 4 ms 22360 KB Output is correct
11 Correct 4 ms 22364 KB Output is correct
12 Correct 4 ms 22364 KB Output is correct
13 Correct 3 ms 22364 KB Output is correct
14 Correct 5 ms 22484 KB Output is correct
15 Correct 5 ms 22364 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22364 KB Output is correct
2 Correct 5 ms 22364 KB Output is correct
3 Correct 3 ms 22416 KB Output is correct
4 Correct 4 ms 22364 KB Output is correct
5 Correct 3 ms 22364 KB Output is correct
6 Correct 4 ms 22364 KB Output is correct
7 Correct 3 ms 22360 KB Output is correct
8 Correct 3 ms 22364 KB Output is correct
9 Correct 3 ms 22364 KB Output is correct
10 Correct 3 ms 22364 KB Output is correct
11 Correct 5 ms 22364 KB Output is correct
12 Correct 3 ms 22364 KB Output is correct
13 Correct 4 ms 22364 KB Output is correct
14 Correct 5 ms 22452 KB Output is correct
15 Correct 4 ms 22364 KB Output is correct
16 Correct 3 ms 22364 KB Output is correct
17 Correct 7 ms 22364 KB Output is correct
18 Correct 4 ms 22364 KB Output is correct
19 Correct 4 ms 22364 KB Output is correct
20 Correct 4 ms 22364 KB Output is correct
21 Correct 4 ms 22364 KB Output is correct
22 Correct 3 ms 22364 KB Output is correct
23 Correct 4 ms 22452 KB Output is correct
24 Correct 8 ms 22360 KB Output is correct
25 Correct 6 ms 22360 KB Output is correct
26 Correct 3 ms 22364 KB Output is correct
27 Correct 4 ms 22364 KB Output is correct
28 Correct 5 ms 22436 KB Output is correct
29 Correct 8 ms 22460 KB Output is correct
30 Correct 5 ms 22364 KB Output is correct
31 Correct 7 ms 22444 KB Output is correct
32 Correct 6 ms 22364 KB Output is correct
33 Correct 15 ms 22364 KB Output is correct
34 Correct 17 ms 22480 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22364 KB Output is correct
2 Correct 3 ms 22364 KB Output is correct
3 Correct 3 ms 22364 KB Output is correct
4 Correct 3 ms 22364 KB Output is correct
5 Correct 4 ms 22360 KB Output is correct
6 Correct 3 ms 22360 KB Output is correct
7 Correct 4 ms 22364 KB Output is correct
8 Correct 3 ms 22364 KB Output is correct
9 Correct 3 ms 22364 KB Output is correct
10 Correct 4 ms 22200 KB Output is correct
11 Correct 4 ms 22360 KB Output is correct
12 Correct 4 ms 22360 KB Output is correct
13 Correct 4 ms 22364 KB Output is correct
14 Correct 4 ms 22364 KB Output is correct
15 Correct 4 ms 22364 KB Output is correct
16 Correct 3 ms 22432 KB Output is correct
17 Correct 7 ms 22440 KB Output is correct
18 Correct 3 ms 22360 KB Output is correct
19 Correct 3 ms 22432 KB Output is correct
20 Correct 3 ms 22364 KB Output is correct
21 Correct 3 ms 22360 KB Output is correct
22 Correct 3 ms 22360 KB Output is correct
23 Correct 5 ms 22364 KB Output is correct
24 Correct 8 ms 22484 KB Output is correct
25 Correct 6 ms 22364 KB Output is correct
26 Correct 4 ms 22364 KB Output is correct
27 Correct 4 ms 22364 KB Output is correct
28 Correct 5 ms 22364 KB Output is correct
29 Correct 8 ms 22224 KB Output is correct
30 Correct 5 ms 22364 KB Output is correct
31 Correct 6 ms 22360 KB Output is correct
32 Correct 5 ms 22360 KB Output is correct
33 Correct 12 ms 22488 KB Output is correct
34 Correct 14 ms 22360 KB Output is correct
35 Correct 35 ms 22800 KB Output is correct
36 Correct 6 ms 22360 KB Output is correct
37 Correct 29 ms 22620 KB Output is correct
38 Correct 56 ms 22620 KB Output is correct
39 Correct 31 ms 22620 KB Output is correct
40 Correct 80 ms 22620 KB Output is correct
41 Correct 68 ms 22616 KB Output is correct
42 Correct 7 ms 22616 KB Output is correct
43 Correct 6 ms 22432 KB Output is correct
44 Correct 6 ms 22416 KB Output is correct
45 Correct 84 ms 23148 KB Output is correct
46 Correct 82 ms 23060 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22364 KB Output is correct
2 Correct 3 ms 22364 KB Output is correct
3 Correct 3 ms 22364 KB Output is correct
4 Correct 3 ms 22364 KB Output is correct
5 Correct 3 ms 22364 KB Output is correct
6 Correct 3 ms 22364 KB Output is correct
7 Correct 4 ms 22360 KB Output is correct
8 Correct 3 ms 22364 KB Output is correct
9 Correct 3 ms 22364 KB Output is correct
10 Correct 4 ms 22364 KB Output is correct
11 Correct 4 ms 22364 KB Output is correct
12 Correct 4 ms 22364 KB Output is correct
13 Correct 3 ms 22360 KB Output is correct
14 Correct 5 ms 22616 KB Output is correct
15 Correct 4 ms 22364 KB Output is correct
16 Correct 3 ms 22364 KB Output is correct
17 Correct 7 ms 22364 KB Output is correct
18 Correct 4 ms 22364 KB Output is correct
19 Correct 4 ms 22364 KB Output is correct
20 Correct 4 ms 22364 KB Output is correct
21 Correct 4 ms 22364 KB Output is correct
22 Correct 3 ms 22364 KB Output is correct
23 Correct 5 ms 22364 KB Output is correct
24 Correct 8 ms 22484 KB Output is correct
25 Correct 7 ms 22360 KB Output is correct
26 Correct 4 ms 22364 KB Output is correct
27 Correct 3 ms 22364 KB Output is correct
28 Correct 5 ms 22360 KB Output is correct
29 Correct 9 ms 22364 KB Output is correct
30 Correct 4 ms 22364 KB Output is correct
31 Correct 6 ms 22440 KB Output is correct
32 Correct 5 ms 22364 KB Output is correct
33 Correct 13 ms 22364 KB Output is correct
34 Correct 15 ms 22484 KB Output is correct
35 Correct 36 ms 22616 KB Output is correct
36 Correct 6 ms 22360 KB Output is correct
37 Correct 29 ms 22620 KB Output is correct
38 Correct 59 ms 22620 KB Output is correct
39 Correct 32 ms 22616 KB Output is correct
40 Correct 80 ms 22616 KB Output is correct
41 Correct 72 ms 22620 KB Output is correct
42 Correct 7 ms 22668 KB Output is correct
43 Correct 9 ms 22620 KB Output is correct
44 Correct 6 ms 22620 KB Output is correct
45 Correct 87 ms 22992 KB Output is correct
46 Correct 103 ms 22992 KB Output is correct
47 Correct 130 ms 23324 KB Output is correct
48 Correct 8 ms 22620 KB Output is correct
49 Runtime error 24 ms 45912 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -