oj.uz

Submission #1026247

# Submission time Handle Problem Language Result Execution time Memory
1026247 2024-07-17T18:26:31 Z xnqs Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 783 ms 108736 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 = 2500000;
	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 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 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

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 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 5 ms 3120 KB Output is correct
12 Correct 26 ms 10800 KB Output is correct
13 Correct 33 ms 10836 KB Output is correct
14 Correct 4 ms 2908 KB Output is correct
15 Correct 3 ms 2904 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 5 ms 3164 KB Output is correct
12 Correct 28 ms 10844 KB Output is correct
13 Correct 37 ms 10992 KB Output is correct
14 Correct 4 ms 2908 KB Output is correct
15 Correct 3 ms 2920 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 20 ms 3732 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 638 ms 108736 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 6 ms 3164 KB Output is correct
24 Correct 14 ms 3508 KB Output is correct
25 Correct 9 ms 3332 KB Output is correct
26 Correct 337 ms 106684 KB Output is correct
27 Correct 360 ms 108476 KB Output is correct
28 Correct 5 ms 3676 KB Output is correct
29 Correct 14 ms 5724 KB Output is correct
30 Correct 3 ms 3420 KB Output is correct
31 Correct 7 ms 4420 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 48 ms 8552 KB Output is correct
34 Correct 83 ms 8368 KB Output is correct

Subtask #4
0 / 21.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 2736 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 2908 KB Output is correct
11 Correct 4 ms 3160 KB Output is correct
12 Correct 27 ms 10844 KB Output is correct
13 Correct 34 ms 10732 KB Output is correct
14 Correct 4 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 20 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 594 ms 108664 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 3016 KB Output is correct
24 Correct 15 ms 3420 KB Output is correct
25 Correct 9 ms 3420 KB Output is correct
26 Correct 364 ms 106756 KB Output is correct
27 Correct 343 ms 108372 KB Output is correct
28 Correct 5 ms 3676 KB Output is correct
29 Correct 13 ms 5724 KB Output is correct
30 Correct 3 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 49 ms 8428 KB Output is correct
34 Correct 84 ms 8448 KB Output is correct
35 Correct 145 ms 10128 KB Output is correct
36 Correct 22 ms 3676 KB Output is correct
37 Correct 250 ms 16712 KB Output is correct
38 Correct 279 ms 14088 KB Output is correct
39 Correct 182 ms 15248 KB Output is correct
40 Incorrect 770 ms 17144 KB Output isn't correct
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 2648 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 4 ms 3144 KB Output is correct
12 Correct 27 ms 10836 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 28 ms 3668 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 599 ms 108628 KB Output is correct
21 Correct 2 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 3500 KB Output is correct
25 Correct 11 ms 3420 KB Output is correct
26 Correct 338 ms 106728 KB Output is correct
27 Correct 359 ms 108372 KB Output is correct
28 Correct 5 ms 3676 KB Output is correct
29 Correct 13 ms 5632 KB Output is correct
30 Correct 3 ms 3420 KB Output is correct
31 Correct 7 ms 4188 KB Output is correct
32 Correct 4 ms 3676 KB Output is correct
33 Correct 51 ms 8512 KB Output is correct
34 Correct 85 ms 8560 KB Output is correct
35 Correct 150 ms 10128 KB Output is correct
36 Correct 22 ms 3664 KB Output is correct
37 Correct 253 ms 16816 KB Output is correct
38 Correct 273 ms 14092 KB Output is correct
39 Correct 171 ms 15248 KB Output is correct
40 Incorrect 783 ms 17404 KB Output isn't correct
41 Halted 0 ms 0 KB -