제출 #236177

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236177		thtsshz_bgwrswh	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	358 ms	8692 KiB

skyscraper

#pragma GCC optimize("Ofast")
#include<stdio.h>
#include<vector>
#include<queue>
#include<set>
#include<utility>
#include<algorithm>
using namespace std;
int pos[30005],power[30005],dis[30005];
vector<pair<int,int>> g[30005];
set<int> s[30005];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
int main(){
	int i,n,m;
	scanf("%d%d",&n,&m);	
	for(i=0;i<m;i++){
		scanf("%d%d",&pos[i],&power[i]);
		s[pos[i]].insert(power[i]);
	}
	for(i=0;i<n;i++)
		dis[i]=1000000000;
	dis[pos[0]]=0;
	pq.push({0,pos[0]});
	while(pq.size()){
		auto v=pq.top().second;
		pq.pop();
		if(v==pos[1]){
			printf("%d\n",dis[pos[1]]);
			return 0;
		}
		for(auto x:s[v]){
			for(i=v+x;i<n;i+=x){
				if(dis[i]>dis[v]+(i-v)/x){
					dis[i]=dis[v]+(i-v)/x;
					pq.push({dis[i],i});
				}
				if(s[i].count(x))
					break;
			}
			for(i=v-x;i>=0;i-=x){
				if(dis[i]>dis[v]+(v-i)/x){
					dis[i]=dis[v]+(v-i)/x;
					pq.push({dis[i],i});
				}
				if(s[i].count(x))
					break;
			}
		}
	}
	puts("-1");
}

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:15: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:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&pos[i],&power[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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