제출 #936514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
936514		tamir1	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	799 ms	3836 KiB

skyscraper

#include<bits/stdc++.h>
#define ll int
#define ff first
#define ss second
using namespace std;
ll n,m,i,j,b[30005],p[30005],x,y;
vector<ll> v[30005];
set<pair<ll,ll>> q;
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m;
	vector<ll> dist(n,1e9);
	for(i=0;i<m;i++){
		cin >> b[i] >> p[i];
		v[b[i]].push_back(p[i]);
	}
	dist[b[0]]=0;
	q.insert({0,b[0]});
	while(!q.empty()){
		pair<ll,ll> z=*q.begin();
		x=z.ss;
		y=z.ff;
		q.erase(q.begin());
		for(ll i:v[x]){
			ll b,p;
			p=0;
			for(b=x;b<n;b+=i){	
				if(dist[b]>y+p){
					if(dist[b]<1e9) q.erase({dist[b],b});
					dist[b]=y+p;
					q.insert({dist[b],b});
				}
				p++;
			}
			p=0;
			for(b=x;b>=0;b-=i){
				if(dist[b]>y+p){
					if(dist[b]<1e9) q.erase({dist[b],b});
					dist[b]=y+p;
					q.insert({dist[b],b});
				}
				p++;
			}
		}
	}
	if(dist[b[1]]!=1e9) cout << dist[b[1]];
	else cout << -1;
}

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