Language: C++

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

const int EPS = 1e-6;

struct Building{
	double x,y;
}

struct Edge{
	int to;
	double dist;
	Edge(){}
	Edge(int to_c, double dist_c){
		to = to_c; dist = dist_c;
	}
};

struct Data{
	int n, cost;
	Data(){}
	Data(int n_c, int cost_c){
		n = n_c; cost = cost_c;
	}
	bool operator
}

double GetDistnace(Building b1, Building b2){
	int dx = b1.x - b2.x, dy = b1.y - b2.y;
	return sqrt(dx*dx + dy*dy);
}

vector<Edge> e[1000];

int main(){
	Building b[1000] = {};
	int N, M;
	cin >> N;
	for(int i = 0; i < N; i++){
		int indx;
		cin >> indx; indx--;
		cin >> b[indx].x >> b[indx].y;
	}
	for(int i = 0; i < N; i++){
		if(b[i].x == 0) continue;
		for(int j = 0; j < N; j++){
			if(i == j || b[j].x == 0) continue;
			double dist = GetDistance(b[i], b[j]);
			if(dist <= 50) e[i].push( Edge(j, dist) );
		}
	}
	
	cin >> M;
	for(int i = 0; i < M; i++){
		int s,g;
		cin >> s >> g; s--; g--;
		
		priority_queue<Data> pq;
		Data fpq;
		pq.push( Data(s, 0) );
		double memo[1000];
		fill_n(memo, 1000, 100000);
		while( !pq.empty() ){
			fpq = pq.top();
			if(fpq.n == g) break;
			if(memo[fpq.n] <= 10000) continue;
			for(int j = 0; j < e[fpq.n].size(); j++){
				pq.push( Data( e[fpq.n][j].to, fpq.cost + e[fpq.n][j].dist ) );
			}
		}
		vector<int> ans;
		for(int j = g; j != s;){
			for(int k = 0; k < 1000; k++){
				if( abs( memo[k] + e[j][k].dist - memo[j] ) < EPS ){
					j = k; break;
				}
			}
		}
	}
	
	return 0;
}

Compiler output:
a.cc:8:2: error: expected ';' after struct definition
    8 | }
      |  ^
      |  ;
a.cc:26:1: error: expected type-specifier before '}' token
   26 | }
      | ^
a.cc:26:2: error: expected ';' after struct definition
   26 | }
      |  ^
      |  ;
a.cc: In function 'int main()':
a.cc:48:39: error: 'GetDistance' was not declared in this scope; did you mean 'GetDistnace'?
   48 |                         double dist = GetDistance(b[i], b[j]);
      |                                       ^~~~~~~~~~~
      |                                       GetDistnace
a.cc:49:45: error: 'class std::vector<Edge>' has no member named 'push'
   49 |                         if(dist <= 50) e[i].push( Edge(j, dist) );
      |                                             ^~~~
In file included from /usr/include/c++/14/string:49,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_function.h: In instantiation of 'constexpr bool std::less<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = Data]':
/usr/include/c++/14/bits/predefined_ops.h:196:23:   required from 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<Data*, std::vector<Data, std::allocator<Data> > >; _Value = Data; _Compare = std::less<Data>]'
  196 |         { return bool(_M_comp(*__it, __val)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:140:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<Data*, vector<Data, allocator<Data> > >; _Distance = long int; _Tp = Data; _Compare = __gnu_cxx::__ops::_Iter_comp_val<less<Data> >]'
  140 |       while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
      |                                          ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:216:23:   required from 'void std::push_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<Data*, vector<Data, allocator<Data> > >; _Compare = less<Data>]'
  216 |       std::__push_heap(__first, _DistanceType((__last - __first) - 1),
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  217 |                        _DistanceType(0), _GLIBCXX_MOVE(__value), __cmp);
      |                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_queue.h:747:16:   required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(value_type&&) [with _Tp = Data; _Sequence = std::vector<Data, std::allocator<Data> >; _Compare = std::less<Data>; value_type = Data]'
  747 |         std::push_heap(c.begin(), c.end(), comp);
      |         ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:60:10:   required from here
   60 |                 pq.push( Data(s, 0) );
      |                 ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_function.h:405:20: error: no match for 'operator<' (operand types are 'const Data' and 'const Data')
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:64,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51:
/usr/include/c++/14/bits/stl_pair.h:1045:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator<(const pair<_T1, _T2>&, const pair<_T1, _T2>&)'
 1045 |     operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_pair.h:1045:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const Data' is not derived from 'const std::pair<_T1, _T2>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:67:
/usr/include/c++/14/bits/stl_iterator.h:448:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator<(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)'
  448 |     operator<(const reverse_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:448:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const Data' is not derived from 'const std::reverse_iterator<_Iterator>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
/usr/include/c++/14/bits/stl_iterator.h:493:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator<(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)'
  493 |     operator<(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:493:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const Data' is not derived from 'const std::reverse_iterator<_Iterator>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
/usr/include/c++/14/bits/stl_iterator.h:1694:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator<(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)'
 1694 |     operator<(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1694:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const Data' is not derived from 'const std::move_iterator<_IteratorL>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~
/usr/include/c++/14/bits/stl_iterator.h:1760:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator<(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)'
 1760 |     operator<(const move_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/14/bits/stl_iterator.h:1760:5: note:   template argument deduction/substitution failed:
/usr/include/c++/14/bits/stl_function.h:405:20: note:   'const Data' is not derived from 'const std::move_iterator<_IteratorL>'
  405 |       { return __x < __y; }
      |                ~~~~^~~~~