제출 #678317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
678317		hello_there_123	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	363 ms	215860 KiB

skyscraper

#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> >v[300005];
int sto[5005][5005];
	priority_queue<pair<int,int>,vector<pair<int,int> >, greater<pair<int,int> >  >pq;
main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
	int N,M;
	cin>>N>>M;
	for(int i=0;i<=N;i++)
		for(int j=0;j<=N;j++)
			sto[i][j] = 1e9;
	bool occ[N+3];
	memset(occ,0,sizeof(occ));
	vector<pair<int,int> >hi;
	for(int i=0;i<M;i++){
		int a,b;
		cin>>a>>b;
		occ[a] = 1;
		hi.push_back(make_pair(a,b));
	}
	for(int i=0;i<M;i++){
		int x = 1;
		while(hi[i].first-x*hi[i].second>=0){
			//if(occ[hi[i].first-x*hi[i].second])v[hi[i].first].push_back(make_pair(hi[i].first-x*hi[i].second,x));
			if(occ[hi[i].first-x*hi[i].second])sto[hi[i].first][hi[i].first-x*hi[i].second] = min(sto[hi[i].first][hi[i].first-x*hi[i].second],x);
			x++;
		}
		x = 1;
		while(hi[i].first+x*hi[i].second<N){
			//if(occ[hi[i].first+x*hi[i].second])v[hi[i].first].push_back(make_pair(hi[i].first+x*hi[i].second,x));
			if(occ[hi[i].first+x*hi[i].second])sto[hi[i].first][hi[i].first+x*hi[i].second] = min(sto[hi[i].first][hi[i].first+x*hi[i].second],x);
			x++;
		}
	}
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(sto[i][j]!=1e9) v[i].push_back(make_pair(j,sto[i][j]));
		} 
	}
	pq.push(make_pair(0,hi[0].first));
	int dist[300005];
	for(int i=0;i<300004;i++) dist[i] = 1e9;
	dist[hi[0].first] = 0;
	while(!pq.empty()){
		int dis = pq.top().first;
		int no = pq.top().second;
		pq.pop();
		if(dist[no]<dis)continue;
		for(pair<int,int>p:v[no]){
			if(dis+p.second<dist[p.first]){
				dist[p.first] = dis+p.second;
				pq.push(make_pair(dis+p.second,p.first));
			}
		}
	}
	if(dist[hi[1].first] == 1e9) cout<<"-1";
	else cout<<dist[hi[1].first];
}

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

skyscraper.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    6 | main(){
      | ^~~~

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