Submission #68800

#	Time	Username	Problem	Language	Result	Execution time	Memory
68800		FedericoS	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1079 ms	2840 KiB

skyscraper

#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <deque>
using namespace std;
typedef pair<int,pair<int,int>> pp;

int N,M;
int B[30005],P[30005];
vector<int> V[30005];
deque<pp> Q;

int main(){

	cin>>N>>M;
	for(int i=0;i<M;i++){
		cin>>B[i]>>P[i];
		if(i)
			V[B[i]].push_back(i);
	}

	//indice distanza posizione

	Q.push_back({0,{0,B[0]}});

	while(!Q.empty()){

		pp p=Q.front();
		Q.pop_front();

		//cout<<Q.size()<<" "<<p.first<<" "<<p.second.first<<" "<<p.second.second<<endl;

		if(p.first==1){
			cout<<p.second.first;
			return 0;
		}

		for(int x:V[p.second.second])
			Q.push_front({x,{p.second.first,B[x]}});
		V[p.second.second].clear();

		if(p.second.second==B[p.first]){
			if(p.second.second-P[p.first]>=0)
				Q.push_back({p.first,{p.second.first+1,p.second.second-P[p.first]}});
			if(p.second.second+P[p.first]<N)
				Q.push_back({p.first,{p.second.first+1,p.second.second+P[p.first]}});
		}

		if(p.second.second<B[p.first]){
			if(p.second.second-P[p.first]>=0)
				Q.push_back({p.first,{p.second.first+1,p.second.second-P[p.first]}});
		}

		if(p.second.second>B[p.first]){
			if(p.second.second+P[p.first]<N)
				Q.push_back({p.first,{p.second.first+1,p.second.second+P[p.first]}});
		}

	}

	cout<<-1;

}

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