oj.uz

답안 #1026253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1026253 2024-07-17T18:31:19 Z xnqs Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 614 ms 71132 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)*10,pos,dog);
	dist[pos][dog] = -0x3f3f3f3f;

	int iterations = 1500000;
	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)*10,
				          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)*10,
				          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)*10,
				           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)*10,
				           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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2664 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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 2892 KB Output is correct
11 Correct 5 ms 3160 KB Output is correct
12 Correct 26 ms 10848 KB Output is correct
13 Correct 32 ms 10820 KB Output is correct
14 Correct 12 ms 2908 KB Output is correct
15 Correct 8 ms 3140 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 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 4 ms 3164 KB Output is correct
12 Correct 27 ms 10804 KB Output is correct
13 Correct 38 ms 10832 KB Output is correct
14 Correct 8 ms 3164 KB Output is correct
15 Correct 8 ms 3104 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 25 ms 3880 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 596 ms 70996 KB Output is correct
21 Correct 1 ms 2904 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 5 ms 3168 KB Output is correct
24 Correct 16 ms 3420 KB Output is correct
25 Correct 12 ms 3160 KB Output is correct
26 Correct 218 ms 65360 KB Output is correct
27 Correct 220 ms 66284 KB Output is correct
28 Correct 5 ms 3676 KB Output is correct
29 Correct 42 ms 5688 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 10 ms 4188 KB Output is correct
32 Correct 6 ms 3676 KB Output is correct
33 Correct 141 ms 8412 KB Output is correct
34 Correct 149 ms 8532 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 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 4 ms 3164 KB Output is correct
12 Correct 26 ms 10804 KB Output is correct
13 Correct 32 ms 10832 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 8 ms 3036 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 22 ms 3716 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 614 ms 71132 KB Output is correct
21 Correct 1 ms 2648 KB Output is correct
22 Correct 1 ms 2740 KB Output is correct
23 Correct 5 ms 3164 KB Output is correct
24 Correct 15 ms 3516 KB Output is correct
25 Correct 12 ms 3160 KB Output is correct
26 Correct 254 ms 65360 KB Output is correct
27 Correct 216 ms 66128 KB Output is correct
28 Correct 5 ms 3928 KB Output is correct
29 Correct 42 ms 5460 KB Output is correct
30 Correct 4 ms 3416 KB Output is correct
31 Correct 10 ms 4356 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 142 ms 8604 KB Output is correct
34 Correct 151 ms 8372 KB Output is correct
35 Correct 146 ms 9868 KB Output is correct
36 Correct 26 ms 3672 KB Output is correct
37 Correct 254 ms 16484 KB Output is correct
38 Correct 274 ms 13832 KB Output is correct
39 Correct 211 ms 14980 KB Output is correct
40 Incorrect 433 ms 12280 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 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
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 7 ms 3160 KB Output is correct
12 Correct 26 ms 10844 KB Output is correct
13 Correct 34 ms 10844 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 8 ms 2908 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 21 ms 3820 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 597 ms 70996 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 3184 KB Output is correct
24 Correct 15 ms 3528 KB Output is correct
25 Correct 12 ms 3340 KB Output is correct
26 Correct 218 ms 65156 KB Output is correct
27 Correct 216 ms 66300 KB Output is correct
28 Correct 5 ms 3672 KB Output is correct
29 Correct 41 ms 5704 KB Output is correct
30 Correct 4 ms 3416 KB Output is correct
31 Correct 10 ms 4188 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 150 ms 8532 KB Output is correct
34 Correct 148 ms 8528 KB Output is correct
35 Correct 148 ms 9872 KB Output is correct
36 Correct 25 ms 3676 KB Output is correct
37 Correct 260 ms 16528 KB Output is correct
38 Correct 300 ms 13832 KB Output is correct
39 Correct 174 ms 15048 KB Output is correct
40 Incorrect 429 ms 11764 KB Output isn't correct
41 Halted 0 ms 0 KB -