Submission #161661

#	Time	Username	Problem	Language	Result	Execution time	Memory
161661		nvmdava	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1083 ms	55816 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define N 30001
#define INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007LL
 
unordered_set<int> pl[30005];
bool in[N];
unordered_set<int> calc;
 
queue<pair<int, int> > q;
 
void insert(int s, int v){
	if(in[s]) return;
	in[s] = 1;
 
	for(auto x : pl[s]){
		q.push({s * N + x, v});
		calc.insert(s * N + x);
	}
}
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m, s, e;
    cin>>n>>m;
    for(int i = 1, b, p; i <= m; i++){
    	cin>>b>>p;
    	pl[b].insert(p);
    	if(i == 1)
    		s = b;
    	else if(i == 2)
    		e = b;
    }
    if(s == e){
    	cout<<0;
    	return 0;
    }
    insert(s, 0);
    while(!q.empty()){
    	int b = q.front().ff / N;
    	int p = q.front().ff % N;
    	int v = q.front().ss;
    	q.pop();
 
    	if(b >= p){
    		if(b - p == e){
    			cout<<v + 1;
    			return 0;
    		}
    		if(calc.count((b - p) * N + p) == 0){
    			insert(b - p, v + 1);
    			if(calc.count((b - p) * N + p) == 0){
    				q.push({(b - p) * N  + p, v + 1});
    				calc.insert((b - p) * N + p);
    			}
    		}
    	}
    	if(b + p < n){
    		if(b + p == e){
    			cout<<v + 1;
    			return 0;
    		}
    		if(calc.count((b + p) * N + p) == 0){
    			insert(b + p, v + 1);
    			if(calc.count((b + p) * N + p) == 0){
    				q.push({(b + p) * N  + p, v + 1});
    				calc.insert((b + p) * N + p);
    			}
    		}
    	}
    }
    cout<<-1;
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:53:7: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
       if(b - p == e){
       ^~
skyscraper.cpp:31:15: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int n, m, s, e;
               ^

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