제출 #328978

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
328978		minoum	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1095 ms	3300 KiB

skyscraper

#include<bits/stdc++.h>
 
using namespace std;
typedef long long int ll;
 
const int MAXN = 3e4 + 1, inf = INT_MAX / 2;
int n, m, b[2], d[MAXN], sz = 0;
bool wasmn[MAXN];
vector <int> ps[MAXN];
priority_queue <pair<int,int>> q;

int main()
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> m;
//	scanf("%d", &n); scanf("%d", &m);
	int bb, pp;
	for(int i = 0; i < m; i++){
		cin >> bb >> pp;
//		scanf("%d", &bb); scanf("%d", &pp);
		ps[bb].push_back({pp});
		if(i == 0) b[0] = bb;
		if(i == 1) b[1] = bb;
	}
	for(int i = 0; i < n; i++) d[i] = inf;
	d[b[0]] = 0;
	q.push({0, b[0]});
	while(!q.empty()){
		int u = q.top().second, dd = -q.top().second; q.pop();
		if(d[u] < dd) continue;
		if(u == b[1] || d[u] >= inf) break;
		for(int k: ps[u]){
			for(int i = u % k; i < n; i += k)
				if(d[i] > d[u] + (abs(u - i) / k)){
					d[i] = d[u] + (abs(u - i) / k);
					q.push({-d[i], i});
				}
		}
	}
	cout << ((d[b[1]] >= inf)?-1:d[b[1]]);
//	if(d[b[1]] >= inf) printf("%d", -1);
//	else printf("%d", d[b[1]]);
	return 0; 
}

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