Submission #49572

#	Time	Username	Problem	Language	Result	Execution time	Memory
49572		hamzqq9	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	131 ms	3820 KiB

skyscraper

#include<bits/stdc++.h>
#define lf double
#define ll long long
#define cc pair<char,char>
#define ull unsigned ll
#define ii pair<int,int>
#define li pair<ll,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define iiii2 pair<int,iii>
#define lii pair<ll,ii>
#define lolo pair<ll,ll>
#define heap priority_queue
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(),x.end()
#define len(x) strlen(x)
#define sz(x) (int) x.size()
#define orta ((bas+son)/2)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define MOD 1000000007
#define inf 1000000005
#define M 10000002
#define N 30005
#define LOG 40
#define magic 100
#define KOK 250
#define EPS 0.0025
#define pw(x) ((1ll)<<(x))
#define PI 3.1415926535
using namespace std;

int n,m,b,p,from,to;
int dst[N];
vector<int> go[N];

int main() {
 
 	#if 0
	freopen("input.txt","r",stdin);
 	#endif

	scanf("%d %d",&n,&m);

	for(int i=1;i<=m;i++) {

		scanf("%d %d",&b,&p);

		go[b].pb(p);

		if(i==1) from=b;

		if(i==2) to=b;

	}

	for(int i=0;i<n;i++) {

		sort(all(go[i]));

		go[i].erase(unique(all(go[i])),go[i].end());

	}

	fill(dst,dst+N,inf);

	heap<ii> H;

	H.push({0,from});

	dst[from]=0;

	while(!H.empty()) {

		ii x=H.top();

		H.pop();

		if(dst[x.nd]<-x.st) continue ;

		if(x.nd==to) {

			printf("%d",dst[to]);
			
			return 0;

		}

		for(int p:go[x.nd]) {

			for(int i=x.nd+p;i<n;i+=p) {

				if(dst[i]>-x.st+(i-x.nd)/p) H.push({-(dst[i]=-x.st+(i-x.nd)/p),i});

				if(binary_search(all(go[i]),p)) break ;


			}

			for(int i=x.nd-p;i>=0;i-=p) {

				if(dst[i]>-x.st+(x.nd-i)/p) H.push({-(dst[i]=-x.st+(x.nd-i)/p),i});

				if(binary_search(all(go[i]),p)) break ;

			}

		} 

	}

	printf("-1");

}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:53:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
skyscraper.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&b,&p);
   ~~~~~^~~~~~~~~~~~~~~

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