oj.uz

Submission #1023439

# Submission time Handle Problem Language Result Execution time Memory
1023439 2024-07-14T18:48:03 Z xnqs Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 88448 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <unordered_map>

int x, dog_cnt;
std::vector<std::pair<int,int>> dogs; 
std::unordered_map<int,int> dist[30005];
std::vector<int> dogs_in[30005];

int astar(int pos, int dog) {
	std::priority_queue<std::tuple<int,int,int>, std::vector<std::tuple<int,int,int>>, std::greater<std::tuple<int,int,int>>> pq;
	pq.emplace(0+std::abs(pos-dogs[1].first),pos,dog);
	dist[pos][dog] = 0;

	int iterations = 2000000;
	while (!pq.empty()&&iterations--) {
		auto [c, pos, dog] = pq.top();
		pq.pop();

		if (pos-dogs[dog].second>=0) {
			if (!dist[pos-dogs[dog].second].count(dog)||dist[pos-dogs[dog].second][dog]>dist[pos][dog]+1) {
				dist[pos-dogs[dog].second][dog] = dist[pos][dog]+1;
				pq.emplace(dist[pos-dogs[dog].second][dog]+std::abs((pos-dogs[dog].second)-dogs[1].first),
				          pos-dogs[dog].second,
						  dog);
			}
		}
		if (pos+dogs[dog].second<x) {
			if (!dist[pos+dogs[dog].second].count(dog)||dist[pos+dogs[dog].second][dog]>dist[pos][dog]+1) {
				dist[pos+dogs[dog].second][dog] = dist[pos][dog]+1;
				pq.emplace(dist[pos+dogs[dog].second][dog]+std::abs((pos+dogs[dog].second)-dogs[1].first),
				          pos+dogs[dog].second,
						  dog);
			}
		}

		for (const auto& i : dogs_in[pos]) {
			if (!dist[pos].count(i)||dist[pos][i]>dist[pos][dog]) {
				dist[pos][i] = dist[pos][dog];
				pq.emplace(dist[pos][i]+std::abs(pos-dogs[1].first),
				          pos,
						  i);
			}
		}
	}

	int min = 0x3f3f3f3f;
	for (int i = 0; i < dog_cnt; i++) {
		if (!dist[dogs[1].first].count(i)) {
			continue;
		}

		min = std::min(min, dist[dogs[1].first][i]);
	}

	return ((min==0x3f3f3f3f) ? -1 : min);
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);

	std::cin >> x >> dog_cnt;
	dogs.reserve(dog_cnt);

	for (int i = 0, a, b; i < dog_cnt; i++) {
		std::cin >> a >> b;
		dogs.emplace_back(a,b);
		dogs_in[a].emplace_back(i);
	}

	std::cout << astar(dogs[0].first, 0) << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 0 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 7 ms 3164 KB Output is correct
12 Correct 69 ms 10756 KB Output is correct
13 Correct 72 ms 10832 KB Output is correct
14 Correct 8 ms 3160 KB Output is correct
15 Correct 8 ms 2908 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 8 ms 3164 KB Output is correct
12 Correct 84 ms 10772 KB Output is correct
13 Correct 72 ms 10836 KB Output is correct
14 Correct 8 ms 2904 KB Output is correct
15 Correct 7 ms 2972 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 21 ms 3688 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 349 ms 88400 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 5 ms 3164 KB Output is correct
24 Correct 14 ms 3420 KB Output is correct
25 Correct 9 ms 3284 KB Output is correct
26 Correct 313 ms 85840 KB Output is correct
27 Correct 317 ms 87380 KB Output is correct
28 Correct 4 ms 3676 KB Output is correct
29 Correct 15 ms 5708 KB Output is correct
30 Correct 4 ms 3416 KB Output is correct
31 Correct 8 ms 4188 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 69 ms 8412 KB Output is correct
34 Correct 104 ms 8528 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 9 ms 3252 KB Output is correct
12 Correct 69 ms 10708 KB Output is correct
13 Correct 72 ms 10840 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 6 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 26 ms 3676 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 349 ms 88448 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 5 ms 3164 KB Output is correct
24 Correct 15 ms 3420 KB Output is correct
25 Correct 9 ms 3420 KB Output is correct
26 Correct 307 ms 86100 KB Output is correct
27 Correct 320 ms 87360 KB Output is correct
28 Correct 5 ms 3672 KB Output is correct
29 Correct 15 ms 5724 KB Output is correct
30 Correct 5 ms 3420 KB Output is correct
31 Correct 9 ms 4188 KB Output is correct
32 Correct 5 ms 3656 KB Output is correct
33 Correct 65 ms 8500 KB Output is correct
34 Correct 105 ms 8352 KB Output is correct
35 Correct 322 ms 9824 KB Output is correct
36 Correct 27 ms 3668 KB Output is correct
37 Correct 451 ms 16640 KB Output is correct
38 Correct 563 ms 13832 KB Output is correct
39 Correct 322 ms 15184 KB Output is correct
40 Execution timed out 1067 ms 17144 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 9 ms 3084 KB Output is correct
12 Correct 69 ms 10844 KB Output is correct
13 Correct 75 ms 10836 KB Output is correct
14 Correct 10 ms 2908 KB Output is correct
15 Correct 6 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 21 ms 3744 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2736 KB Output is correct
20 Correct 327 ms 88404 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 5 ms 3164 KB Output is correct
24 Correct 17 ms 3524 KB Output is correct
25 Correct 9 ms 3420 KB Output is correct
26 Correct 305 ms 86008 KB Output is correct
27 Correct 317 ms 87380 KB Output is correct
28 Correct 4 ms 3676 KB Output is correct
29 Correct 15 ms 5564 KB Output is correct
30 Correct 4 ms 3420 KB Output is correct
31 Correct 8 ms 4188 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 61 ms 8568 KB Output is correct
34 Correct 108 ms 8524 KB Output is correct
35 Correct 346 ms 9912 KB Output is correct
36 Correct 27 ms 3676 KB Output is correct
37 Correct 438 ms 16572 KB Output is correct
38 Correct 575 ms 13948 KB Output is correct
39 Correct 347 ms 15004 KB Output is correct
40 Execution timed out 1029 ms 17080 KB Time limit exceeded
41 Halted 0 ms 0 KB -