Submission #678229

#TimeUsernameProblemLanguageResultExecution timeMemory
678229penguin133Jakarta Skyscrapers (APIO15_skyscraper)C++17
0 / 100
1 ms980 KiB
#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], pos[S[i]].push_back({P[i], 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[1] = 0;
	priority_queue<pi, vector<pi>, greater<pi> > pq;
	pq.push({0, 1});
	while(!pq.empty()){
		int x = pq.top().fi, y = pq.top().se;
		pq.pop();
		//cout << x << " " << y << '\n';
		if(dist[y] < x)continue;
		for(int i=0;i<n;i++){
			for(auto [j, k] : pos[i]){
				if(abs(i-S[y])%j)continue;
				int d = abs(i - S[y]) / j;
				if(dist[k] > dist[y] + d)dist[k] = dist[y] + d, pq.push({dist[k], k});
				break;
			}
		}
	}
	cout << (dist[0] == 1e9 ? -1 : dist[0]);
}

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();
	}
}

Compilation message (stderr)

skyscraper.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...