제출 #678253

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
678253		penguin133	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	36 / 100	1092 ms	3952 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif

int n, m;
int S[30005], P[30005];
int dist[30005];
vector<pi> pos[30005];
void solve(){
	cin >> n >> m;
	for(int i=0;i<m;i++)cin >> S[i] >> P[i];
	for(int i=0;i<n;i++)sort(pos[i].begin(), pos[i].end(), greater<>());
	for(int i=0;i<m;i++)dist[i] = 1e9;
	dist[0] = 0;
	priority_queue<pi, vector<pi>, greater<pi> > pq;
	pq.push({0, 0});
	unordered_set<int> s;
	for(int i=0;i<m;i++)s.insert(i);
	while(!pq.empty()){
		int x = pq.top().fi, y = pq.top().se;
		pq.pop();
		//cout << x << " " << y << '\n';
		if(dist[y] < x)continue;
		s.erase(y);
		for(auto i : s){
			if(abs(S[i] - S[y]) % P[y])continue;
			if(dist[i] > dist[y] + abs(S[i] - S[y]) / P[y])dist[i] = dist[y] + abs(S[i] - S[y]) / P[y], pq.push({dist[i], i});
		}
	}
	cout << (dist[1] == 1e9 ? -1 : dist[1]);
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

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

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

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