oj.uz

Submission #1026272

# Submission time Handle Problem Language Result Execution time Memory
1026272 2024-07-17T18:42:16 Z xnqs Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 652 ms 91932 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(std::abs(pos-dogs[1].first)/dogs[dog].second,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(std::abs((pos-dogs[dog].second)-dogs[1].first)/dogs[dog].second,
				          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(std::abs((pos+dogs[dog].second)-dogs[1].first)/dogs[dog].second,
				          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(std::abs(pos-dogs[1].first)/dogs[dog].second,
				           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(std::abs(pos-dogs[1].first)/dogs[dog].second,
				           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 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 1 ms 2648 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 2644 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 3128 KB Output is correct
12 Correct 26 ms 10824 KB Output is correct
13 Correct 31 ms 10844 KB Output is correct
14 Correct 12 ms 2908 KB Output is correct
15 Correct 8 ms 2984 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2648 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2648 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 25 ms 10900 KB Output is correct
13 Correct 30 ms 10840 KB Output is correct
14 Correct 9 ms 2972 KB Output is correct
15 Correct 8 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 16 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 592 ms 91800 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 3 ms 3164 KB Output is correct
24 Correct 7 ms 3420 KB Output is correct
25 Correct 12 ms 3164 KB Output is correct
26 Correct 271 ms 85928 KB Output is correct
27 Correct 284 ms 73664 KB Output is correct
28 Correct 6 ms 3676 KB Output is correct
29 Correct 45 ms 5556 KB Output is correct
30 Correct 4 ms 3420 KB Output is correct
31 Correct 10 ms 4276 KB Output is correct
32 Correct 5 ms 3612 KB Output is correct
33 Correct 137 ms 8372 KB Output is correct
34 Correct 144 ms 8532 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 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 25 ms 10704 KB Output is correct
13 Correct 31 ms 10836 KB Output is correct
14 Correct 9 ms 2976 KB Output is correct
15 Correct 8 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 13 ms 3692 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 579 ms 91660 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 3 ms 3164 KB Output is correct
24 Correct 7 ms 3408 KB Output is correct
25 Correct 11 ms 3164 KB Output is correct
26 Correct 270 ms 86152 KB Output is correct
27 Correct 283 ms 73808 KB Output is correct
28 Correct 6 ms 3896 KB Output is correct
29 Correct 40 ms 5716 KB Output is correct
30 Correct 3 ms 3420 KB Output is correct
31 Correct 10 ms 4268 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 153 ms 8536 KB Output is correct
34 Correct 146 ms 8532 KB Output is correct
35 Correct 85 ms 9668 KB Output is correct
36 Correct 23 ms 3672 KB Output is correct
37 Correct 206 ms 16652 KB Output is correct
38 Correct 198 ms 13740 KB Output is correct
39 Correct 172 ms 15372 KB Output is correct
40 Incorrect 652 ms 6704 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 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 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 5 ms 3232 KB Output is correct
12 Correct 25 ms 10844 KB Output is correct
13 Correct 31 ms 10836 KB Output is correct
14 Correct 9 ms 2992 KB Output is correct
15 Correct 9 ms 3036 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 13 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 611 ms 91932 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct
23 Correct 3 ms 3164 KB Output is correct
24 Correct 7 ms 3460 KB Output is correct
25 Correct 11 ms 3412 KB Output is correct
26 Correct 274 ms 85892 KB Output is correct
27 Correct 281 ms 73676 KB Output is correct
28 Correct 5 ms 3672 KB Output is correct
29 Correct 41 ms 5560 KB Output is correct
30 Correct 4 ms 3420 KB Output is correct
31 Correct 10 ms 4444 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 141 ms 8528 KB Output is correct
34 Correct 147 ms 8532 KB Output is correct
35 Correct 86 ms 9612 KB Output is correct
36 Correct 28 ms 3700 KB Output is correct
37 Correct 201 ms 16612 KB Output is correct
38 Correct 213 ms 13836 KB Output is correct
39 Correct 169 ms 15372 KB Output is correct
40 Incorrect 629 ms 6480 KB Output isn't correct
41 Halted 0 ms 0 KB -