Submission #205562

#	Time	Username	Problem	Language	Result	Execution time	Memory
205562		kshitij_sodani	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	10 / 100	6 ms	396 KiB

skyscraper

#include <iostream>
#include <bits/stdc++.h>
 
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl "\n"
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	llo n,m;
	cin>>n>>m;
	llo b[m];
	llo p[m];
	//map<pair<llo,llo>,llo> aa;
	vector<pair<llo,llo>> adj[n];
	for(llo i=0;i<m;i++){
		cin>>b[i]>>p[i];
		llo jj=1;
		for(llo j=b[i]-p[i];j>=0;j=j-p[i]){
			adj[b[i]].pb(mp(j,jj));
			jj+=1;
		}
		jj=1;
		for(llo j=b[i]+p[i];j<n;j=j+p[i]){
			adj[b[i]].pb(mp(j,jj));
			jj+=1;
		}
	}
 
 
	llo dis[n];
	for(llo i=0;i<n;i++){
		dis[i]=-1;
	}
	priority_queue<pair<llo,llo>> aaa;
	aaa.push(mp(0,b[0]));
 
	while(aaa.size()>0){
		pair<llo,llo> x=aaa.top();
		aaa.pop();
		if(dis[x.b]!=-1){
			continue;
		}
		dis[x.b]=x.a;
		for(auto i:adj[x.b]){
			aaa.push(mp(i.b+x.a,i.a));
		}
	}

	cout<<dis[b[1]]<<endl;
 
 
 
 
	return 0;
}

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