제출 #954281

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

skyscraper

#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;

int n, m;
vector<int> b, p;
vector<vector<int>> v;

int solve() {
	vector<int> dist(m, -1);
	priority_queue<tuple<int, int, int>> q;
	dist[b[0]] = 0;
	q.push({0, b[0], 0});
	while (not q.empty() and dist[1] == -1) {
		auto [d, i, j] = q.top();
		q.pop();
		while (not v[i].empty()) {
			dist[v[i].back()] = -d;
			q.push(make_tuple(d, i, v[i].back()));
			v[i].pop_back();
		}
		if (i >= b[j] and i + p[j] < n) q.push(make_tuple(d - 1, i + p[j], j));
		if (i <= b[j] and i - p[j] >= 0) q.push(make_tuple(d - 1, i - p[j], j));
	}
	return dist[1];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m;
	v.resize(n), b.resize(m), p.resize(m);
	cin >> b[0] >> p[0];
	for (int i = 1; i < m; i++) {
		cin >> b[i] >> p[i];
		v[b[i]].push_back(i);
	}
	cout << solve() << '\n';
	return 0;
}

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