oj.uz

답안 #1026254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1026254 2024-07-17T18:31:46 Z xnqs Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 845 ms 90560 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 = 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)*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 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

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 2648 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 10920 KB Output is correct
13 Correct 32 ms 10836 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 7 ms 2908 KB Output is correct

Subtask #3
14.0 / 14.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 2 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 36 ms 10744 KB Output is correct
13 Correct 33 ms 10840 KB Output is correct
14 Correct 8 ms 2904 KB Output is correct
15 Correct 8 ms 2944 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 22 ms 3664 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 778 ms 90560 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 3520 KB Output is correct
25 Correct 12 ms 3160 KB Output is correct
26 Correct 270 ms 86096 KB Output is correct
27 Correct 280 ms 87376 KB Output is correct
28 Correct 8 ms 3672 KB Output is correct
29 Correct 43 ms 5460 KB Output is correct
30 Correct 6 ms 3416 KB Output is correct
31 Correct 10 ms 4188 KB Output is correct
32 Correct 6 ms 3676 KB Output is correct
33 Correct 166 ms 8356 KB Output is correct
34 Correct 153 ms 8532 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 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 3176 KB Output is correct
12 Correct 26 ms 10932 KB Output is correct
13 Correct 32 ms 10760 KB Output is correct
14 Correct 8 ms 2904 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 3672 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Correct 842 ms 90548 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 3172 KB Output is correct
24 Correct 15 ms 3416 KB Output is correct
25 Correct 11 ms 3340 KB Output is correct
26 Correct 266 ms 86000 KB Output is correct
27 Correct 294 ms 87376 KB Output is correct
28 Correct 6 ms 3672 KB Output is correct
29 Correct 42 ms 5716 KB Output is correct
30 Correct 4 ms 3416 KB Output is correct
31 Correct 11 ms 4192 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 141 ms 8528 KB Output is correct
34 Correct 150 ms 8440 KB Output is correct
35 Correct 144 ms 9864 KB Output is correct
36 Correct 26 ms 3672 KB Output is correct
37 Correct 259 ms 16524 KB Output is correct
38 Correct 310 ms 13832 KB Output is correct
39 Correct 172 ms 14988 KB Output is correct
40 Incorrect 601 ms 18168 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 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 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2648 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 2856 KB Output is correct
11 Correct 5 ms 3164 KB Output is correct
12 Correct 26 ms 10844 KB Output is correct
13 Correct 33 ms 10748 KB Output is correct
14 Correct 8 ms 2908 KB Output is correct
15 Correct 8 ms 2904 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 22 ms 3672 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 845 ms 90552 KB Output is correct
21 Correct 1 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 3492 KB Output is correct
25 Correct 12 ms 3164 KB Output is correct
26 Correct 276 ms 86148 KB Output is correct
27 Correct 282 ms 87380 KB Output is correct
28 Correct 5 ms 3676 KB Output is correct
29 Correct 42 ms 5560 KB Output is correct
30 Correct 4 ms 3508 KB Output is correct
31 Correct 10 ms 4196 KB Output is correct
32 Correct 5 ms 3676 KB Output is correct
33 Correct 150 ms 8536 KB Output is correct
34 Correct 149 ms 8392 KB Output is correct
35 Correct 150 ms 9804 KB Output is correct
36 Correct 26 ms 3672 KB Output is correct
37 Correct 298 ms 16688 KB Output is correct
38 Correct 315 ms 13916 KB Output is correct
39 Correct 183 ms 15068 KB Output is correct
40 Incorrect 605 ms 17104 KB Output isn't correct
41 Halted 0 ms 0 KB -