답안 #794743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794743 2023-07-26T21:21:39 Z bane Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
1000 ms 5704 KB
#include<bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

void solve(){
	int n, m;
	cin >> n >> m;
	vector<pair<int,int>>monsters(m);
	vector<set<int>>pos(n);
	for (int i = 0; i < m; i++){
		int b, p;
		cin >> b >> p;
		pos[b].insert(p);
		monsters[i] = {b,p};
	}
	vector<long long>dp(n, (long long)1e18);
	dp[monsters[0].first] = 0;
	priority_queue<pair<long long,int>>pq;
	pq.push({0,monsters[0].first});
	while(!pq.empty()){
		long long dst = -pq.top().first;
		int b = pq.top().second;
		pq.pop();
		//node + pow * x = mn
		if (dp[b] != dst)continue;
		if (b == monsters[1].first){
			cout << dst << endl;
			return ;
		}
		if (pos[b].empty())continue;
		int pmin = *pos[b].begin();
		for (int i = 1; i <= n / pmin; i++){
			for (auto p : pos[b]){
				bool ok = 0;
				int right = b + i * p;
				int left = b - i * p;
				if (left >= 0){
					ok = 1;
					if (dp[left] > dst + i){
						dp[left] = dst + i;
						pq.push({-dst-i,left});
					}
				}  

				if (right <= n - 1){
					ok = 1;
					if (dp[right] > dst + i){
						dp[right] = dst + i;
						pq.push({-dst-i,right});
					}
				}
				if (!ok)break;
			}
		}
	}
	cout << - 1 << endl;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	solve();
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 24 ms 604 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 2 ms 724 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 356 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 24 ms 608 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 2 ms 724 KB Output is correct
35 Correct 8 ms 1876 KB Output is correct
36 Correct 1 ms 584 KB Output is correct
37 Correct 6 ms 1620 KB Output is correct
38 Correct 11 ms 2284 KB Output is correct
39 Correct 8 ms 2132 KB Output is correct
40 Correct 8 ms 2260 KB Output is correct
41 Correct 9 ms 2276 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 4 ms 676 KB Output is correct
44 Correct 27 ms 832 KB Output is correct
45 Correct 11 ms 2132 KB Output is correct
46 Correct 11 ms 2076 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 26 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 2 ms 724 KB Output is correct
35 Correct 8 ms 1904 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 6 ms 1620 KB Output is correct
38 Correct 10 ms 2208 KB Output is correct
39 Correct 8 ms 2132 KB Output is correct
40 Correct 8 ms 2260 KB Output is correct
41 Correct 9 ms 2260 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 27 ms 788 KB Output is correct
45 Correct 12 ms 2132 KB Output is correct
46 Correct 12 ms 2132 KB Output is correct
47 Correct 11 ms 3404 KB Output is correct
48 Correct 5 ms 2772 KB Output is correct
49 Correct 5 ms 2772 KB Output is correct
50 Correct 4 ms 2644 KB Output is correct
51 Correct 14 ms 5704 KB Output is correct
52 Correct 16 ms 4684 KB Output is correct
53 Correct 9 ms 3924 KB Output is correct
54 Correct 2 ms 2264 KB Output is correct
55 Correct 3 ms 2264 KB Output is correct
56 Execution timed out 1096 ms 4176 KB Time limit exceeded
57 Halted 0 ms 0 KB -