Dijkstros algoritmas

Taškai: 0

Compile: FAIL

dijkstra.cpp: In function ‘int main()’: dijkstra.cpp:18:14: error: invalid types ‘long long int[int]’ for array subscript 18 | start[i] = LLONG_MAX; | ^ dijkstra.cpp:21:10: error: invalid types ‘long long int[int]’ for array subscript 21 | start[0] = 0; | ^ dijkstra.cpp:24:22: error: invalid types ‘long long int[int]’ for array subscript 24 | if (start[graf[q.top().second][i].first] > start[q.top().second]+graf[q.top().second][i].second) { | ^ dijkstra.cpp:24:61: error: invalid types ‘long long int[const int]’ for array subscript 24 | if (start[graf[q.top().second][i].first] > start[q.top().second]+graf[q.top().second][i].second) { | ^ dijkstra.cpp:25:22: error: invalid types ‘long long int[int]’ for array subscript 25 | start[graf[q.top().second][i].first] = start[q.top().second]+graf[q.top().second][i].second; | ^ dijkstra.cpp:25:61: error: invalid types ‘long long int[const int]’ for array subscript 25 | start[graf[q.top().second][i].first] = start[q.top().second]+graf[q.top().second][i].second; | ^ dijkstra.cpp:26:31: error: invalid types ‘long long int[int]’ for array subscript 26 | q.push({-start[graf[q.top().second][i].first], graf[q.top().second][i].first}); | ^ dijkstra.cpp:26:23: error: no matching function for call to ‘std::priority_queue<std::pair<long long int, int> >::push(<brace-enclosed initializer list>)’ 26 | q.push({-start[graf[q.top().second][i].first], graf[q.top().second][i].first}); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/11/queue:64, from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:86, from dijkstra.cpp:1: /usr/include/c++/11/bits/stl_queue.h:640:7: note: candidate: ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<long long int, int>; _Sequence = std::vector<std::pair<long long int, int>, std::allocator<std::pair<long long int, int> > >; _Compare = std::less<std::pair<long long int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, int>]’ 640 | push(const value_type& __x) | ^~~~ /usr/include/c++/11/bits/stl_queue.h:640:30: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘const value_type&’ {aka ‘const std::pair<long long int, int>&’} 640 | push(const value_type& __x) | ~~~~~~~~~~~~~~~~~~^~~ /usr/include/c++/11/bits/stl_queue.h:648:7: note: candidate: ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<long long int, int>; _Sequence = std::vector<std::pair<long long int, int>, std::allocator<std::pair<long long int, int> > >; _Compare = std::less<std::pair<long long int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, int>]’ 648 | push(value_type&& __x) | ^~~~ /usr/include/c++/11/bits/stl_queue.h:648:25: note: no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘std::priority_queue<std::pair<long long int, int> >::value_type&&’ {aka ‘std::pair<long long int, int>&&’} 648 | push(value_type&& __x) | ~~~~~~~~~~~~~^~~ dijkstra.cpp:32:22: error: invalid types ‘long long int[int]’ for array subscript 32 | cout << start[i] << " "; | ^

nr.resulttimemessage