Borderou de evaluare (job #1350159)

Utilizator radudorosRadu Doros radudoros Data 20 februarie 2015 18:07:53
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: In file included from /usr/include/c++/4.8/queue:64:0, from user.cpp:2: /usr/include/c++/4.8/bits/stl_queue.h: In instantiation of ‘class std::priority_queue<int, std::pair<int, int>, std::greater<std::pair<int, int> > >’: user.cpp:14:64: required from here /usr/include/c++/4.8/bits/stl_queue.h:370:46: error: no type named ‘value_type’ in ‘struct std::pair<int, int>’ typedef typename _Sequence::value_type _Sequence_value_type; ^ /usr/include/c++/4.8/bits/stl_queue.h:379:61: error: no type named ‘value_type’ in ‘struct std::pair<int, int>’ typedef typename _Sequence::value_type value_type; ^ /usr/include/c++/4.8/bits/stl_queue.h:380:61: error: no type named ‘reference’ in ‘struct std::pair<int, int>’ typedef typename _Sequence::reference reference; ^ /usr/include/c++/4.8/bits/stl_queue.h:381:61: error: no type named ‘const_reference’ in ‘struct std::pair<int, int>’ typedef typename _Sequence::const_reference const_reference; ^ /usr/include/c++/4.8/bits/stl_queue.h:382:61: error: no type named ‘size_type’ in ‘struct std::pair<int, int>’ typedef typename _Sequence::size_type size_type; ^ user.cpp: In function ‘void dijkstra(int)’: user.cpp:27:4: error: ‘class std::priority_queue<int, std::pair<int, int>, std::greater<std::pair<int, int> > >’ has no member named ‘push’ q.push(make_pair(d[s], s)); ^ user.cpp:30:13: error: ‘class std::priority_queue<int, std::pair<int, int>, std::greater<std::pair<int, int> > >’ has no member named ‘top’ int x = q.top().second; ^ user.cpp:33:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < v[x].size(); i++) ^ user.cpp:40:7: error: ‘class std::priority_queue<int, std::pair<int, int>, std::greater<std::pair<int, int> > >’ has no member named ‘push’ q.push(make_pair(d[y], y)); ^ In file included from /usr/include/c++/4.8/queue:64:0, from user.cpp:2: /usr/include/c++/4.8/bits/stl_queue.h: In instantiation of ‘std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = int; _Sequence = std::pair<int, int>; _Compare = std::greater<std::pair<int, int> >]’: user.cpp:14:64: required from here /usr/include/c++/4.8/bits/stl_queue.h:411:48: error: ‘struct std::pair<int, int>’ has no member named ‘begin’ { std::make_heap(c.begin(), c.end(), comp); } ^ /usr/include/c++/4.8/bits/stl_queue.h:411:48: error: ‘struct std::pair<int, int>’ has no member named ‘end’ /usr/include/c++/4.8/bits/stl_queue.h: In instantiation of ‘bool std::priority_queue<_Tp, _Sequence, _Compare>::empty() const [with _Tp = int; _Sequence = std::pair<int, int>; _Compare = std::greater<std::pair<int, int> >]’: user.cpp:28:18: required from here /usr/include/c++/4.8/bits/stl_queue.h:469:24: error: ‘const struct std::pair<int, int>’ has no member named ‘empty’ { return c.empty(); } ^ /usr/include/c++/4.8/bits/stl_queue.h: In instantiation of ‘void std::priority_queue<_Tp, _Sequence, _Compare>::pop() [with _Tp = int; _Sequence = std::pair<int, int>; _Compare = std::greater<std::pair<int, int> >]’: user.cpp:31:9: required from here /usr/include/c++/4.8/bits/stl_queue.h:534:40: error: ‘struct std::pair<int, int>’ has no member named ‘begin’ std::pop_heap(c.begin(), c.end(), comp); ^

Ceva nu functioneaza?