제출 #794712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794712		bane	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1089 ms	2380 KiB

skyscraper

#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<vector<int>>pos(n);
	for (int i = 0; i < m; i++){
		int b, p;
		cin >> b >> p;
		pos[b].push_back(i);
		monsters[i] = {b,p};
	}
	vector<int>dp(m, (int)1e9);
	dp[0] = 0;
	priority_queue<pair<int,int>>pq;
	pq.push({0,0});
	while(!pq.empty()){
		int dst = -pq.top().first;
		int node = pq.top().second;
		pq.pop();
		//node + pow * x = mn
		if (dp[node] != dst)continue;
		if (node == 1){
			cout << dst << endl;
			return ;
		}
		int p = monsters[node].second;
		int b = monsters[node].first;

		for (int i = 0; i <= n / p; i++){
			int right = b + i * p;
			int left = b - i * p;
			if (left >= 0){
				for (int j : pos[left]){
					if (dp[j] > dst + i){
						dp[j] = dst + i;
						pq.push({-dp[j], j});
					}
				}
			}  

			if (right <= n - 1){
				for (int j : pos[right]){
					if (dp[j] > dst + i){
						dp[j] = dst + i;
						pq.push({-dp[j], j});
					}
				}
			}
		}
	}
	cout << - 1 << endl;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	solve();
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43