제출 #636574

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

skyscraper

#include <bits/stdc++.h>
using namespace std;

int main() 
{
	cin.tie(0); ios_base::sync_with_stdio(0);

	int n, m;
	cin >> n >> m;

	vector<int> g[n + 1], p(m), x(m);
	for(int i = 0; i < m; i++) {	
		cin >> x[i] >> p[i];
		g[x[i]].push_back(i);
	}

	queue<pair<int,int>> q;
	q.push({x[0], 0});
	vector<vector<int>> dist(n + 1, vector<int>(m + 1, -1));
	dist[x[0]][0] = 0;
	while(!q.empty()) {
		auto [v, idx] = q.front(); q.pop();
		// cout << v << " " << idx << " " << dist[v][idx] << '\n';
		if(v - p[idx] >= 0 && dist[v - p[idx]][idx] == -1) {
			q.push({v - p[idx], idx});
			dist[v - p[idx]][idx] = dist[v][idx] + 1;
		}
		if(v + p[idx] < n && dist[v + p[idx]][idx] == -1) {
			q.push({v + p[idx], idx});
			dist[v + p[idx]][idx] = dist[v][idx] + 1;
		}
		int d = dist[v][idx];
		for(auto idx : g[v]) {
			dist[v][idx] = d;
			if(v - p[idx] >= 0 && dist[v - p[idx]][idx] == -1) {
				q.push({v - p[idx], idx});
				dist[v - p[idx]][idx] = dist[v][idx] + 1;
			}
			if(v + p[idx] < n && dist[v + p[idx]][idx] == -1) {
				q.push({v + p[idx], idx});
				dist[v + p[idx]][idx] = dist[v][idx] + 1;
			}
		}
	}

	int ans = 1e9;
	for(int i = 0; i < m; i++) {
		if(dist[x[1]][i] != -1) ans = min(ans, dist[x[1]][i]);
	}

	cout << (ans == 1e9 ? -1 : ans);

}

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