oj.uz

Submission #1023463

# Submission time Handle Problem Language Result Execution time Memory
1023463 2024-07-14T19:10:47 Z xnqs Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 653 ms 88676 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(-0x3f3f3f3f+std::abs(pos-dogs[1].first),pos,dog);
	dist[pos][dog] = -0x3f3f3f3f;

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

		if (!dogs_in[pos].empty()) {
			int next_idx = std::lower_bound(dogs_in[pos].begin(),dogs_in[pos].end(),dog)-dogs_in[pos].begin();
			if (next_idx+1>=dogs_in[pos].size()||dogs_in[pos][next_idx]!=dog) {
				next_idx = -1;
			}

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

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

	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]+0x3f3f3f3f);
	}

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

	for (int i = 0; i < 30005; i++) {
		std::sort(dogs_in[i].begin(),dogs_in[i].end());
	}

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

Compilation message

skyscraper.cpp: In function 'int astar(int, int)':
skyscraper.cpp:43:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |    if (next_idx+1>=dogs_in[pos].size()||dogs_in[pos][next_idx]!=dog) {
      |        ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2652 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 2 ms 2812 KB Output is correct
6 Correct 2 ms 2928 KB Output is correct
7 Correct 1 ms 2648 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 2 ms 2652 KB Output is correct
3 Correct 1 ms 2808 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 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 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 7 ms 3160 KB Output is correct
12 Correct 29 ms 10832 KB Output is correct
13 Correct 43 ms 10828 KB Output is correct
14 Correct 5 ms 2904 KB Output is correct
15 Correct 3 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 2 ms 2652 KB Output is correct
4 Correct 2 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 2 ms 2904 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 3 ms 2908 KB Output is correct
11 Correct 6 ms 3160 KB Output is correct
12 Correct 29 ms 10844 KB Output is correct
13 Correct 45 ms 10988 KB Output is correct
14 Correct 6 ms 2904 KB Output is correct
15 Correct 3 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 25 ms 3672 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 387 ms 88676 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2812 KB Output is correct
23 Correct 6 ms 3164 KB Output is correct
24 Correct 16 ms 3352 KB Output is correct
25 Correct 11 ms 3420 KB Output is correct
26 Correct 293 ms 85876 KB Output is correct
27 Correct 307 ms 87380 KB Output is correct
28 Correct 7 ms 3848 KB Output is correct
29 Correct 15 ms 5724 KB Output is correct
30 Correct 5 ms 3420 KB Output is correct
31 Correct 10 ms 4188 KB Output is correct
32 Correct 8 ms 3676 KB Output is correct
33 Correct 54 ms 8392 KB Output is correct
34 Correct 86 ms 8536 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 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 2 ms 2652 KB Output is correct
6 Correct 1 ms 2904 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 3 ms 2908 KB Output is correct
11 Correct 6 ms 3292 KB Output is correct
12 Correct 29 ms 10832 KB Output is correct
13 Correct 34 ms 10844 KB Output is correct
14 Correct 4 ms 2908 KB Output is correct
15 Correct 3 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 21 ms 3676 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 388 ms 88656 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 5 ms 3100 KB Output is correct
24 Correct 16 ms 3388 KB Output is correct
25 Correct 10 ms 3420 KB Output is correct
26 Correct 287 ms 86080 KB Output is correct
27 Correct 321 ms 87296 KB Output is correct
28 Correct 6 ms 3676 KB Output is correct
29 Correct 14 ms 5740 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 3720 KB Output is correct
33 Correct 52 ms 8484 KB Output is correct
34 Correct 88 ms 8376 KB Output is correct
35 Correct 153 ms 10124 KB Output is correct
36 Correct 24 ms 3672 KB Output is correct
37 Correct 273 ms 16752 KB Output is correct
38 Correct 312 ms 14088 KB Output is correct
39 Correct 208 ms 15272 KB Output is correct
40 Incorrect 653 ms 17124 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2904 KB Output is correct
2 Correct 2 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 2 ms 2648 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 2904 KB Output is correct
11 Correct 5 ms 3164 KB Output is correct
12 Correct 29 ms 10764 KB Output is correct
13 Correct 36 ms 10840 KB Output is correct
14 Correct 4 ms 2904 KB Output is correct
15 Correct 4 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 22 ms 3784 KB Output is correct
18 Correct 1 ms 2648 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 378 ms 88496 KB Output is correct
21 Correct 2 ms 2648 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 10 ms 3420 KB Output is correct
26 Correct 326 ms 86152 KB Output is correct
27 Correct 321 ms 87460 KB Output is correct
28 Correct 6 ms 3676 KB Output is correct
29 Correct 16 ms 5580 KB Output is correct
30 Correct 4 ms 3420 KB Output is correct
31 Correct 7 ms 4184 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 54 ms 8408 KB Output is correct
34 Correct 88 ms 8364 KB Output is correct
35 Correct 152 ms 10128 KB Output is correct
36 Correct 24 ms 3676 KB Output is correct
37 Correct 266 ms 16784 KB Output is correct
38 Correct 304 ms 14088 KB Output is correct
39 Correct 191 ms 15244 KB Output is correct
40 Incorrect 621 ms 17008 KB Output isn't correct
41 Halted 0 ms 0 KB -