Submission #678349

#	Time	Username	Problem	Language	Result	Execution time	Memory
678349		penguin133	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	22 / 100	18 ms	21376 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<int> pos[30005];
int go[2005][2005];
bool vis[300005];
queue<int> q[30005];
void solve(){
	cin >> n >> m;
	for(int i=0;i<m;i++)cin >> S[i] >> P[i], pos[S[i]].push_back(i);
	for(int i=0;i<m;i++)dist[i] = 1e9;
	dist[0] = 0;
	q[0].push(0);
	bool f = 0;
	for(int i=0;i<30000;i++){
		while(!q[i].empty()){
			int j = q[i].front(); q[i].pop();
			if(dist[j] < i)continue;
			if(j == 1){
				f = 1;
				break;
			}
			for(auto x : pos[S[j]]){
				if(dist[x] > i){
					dist[x] = i;
					if(P[x] != P[j])q[i].push(x);
				}
			}
			pos[S[j]].clear();
			for(int a=S[j] + P[j];a<n;a+=P[j]){
              if(i + abs(S[j] - a) / P[j] > 30000)break;
				for(auto x : pos[a]){			
					if(dist[x] <= dist[j] + abs(S[j] - S[x]) / P[j])break;
					dist[x] = i + abs(S[j] - S[x]) / P[j];
					if(dist[x] > 30000)continue;
					if(P[x] != P[j])q[dist[x]].push(x);
					break;
				}
			}
			for(int a=S[j] - P[j]; a >= 0; a-= P[j]){
              if(i + abs(S[j] - a) / P[j] > 30000)break;
				for(auto x : pos[a]){			
					if(dist[x] <= dist[j] + abs(S[j] - S[x]) / P[j])break;
					dist[x] = i + abs(S[j] - S[x]) / P[j];
					if(dist[x] > 30000)continue;
					if(P[x] != P[j])q[dist[x]].push(x);
					break;
				}
			}
		}
		if(f)break;
	}
	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();
	}
}

Compilation message (stderr)

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

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