Borderou de evaluare (job #1453004)
| Utilizator |  FMI-M2 Marius Melemciuc Marius_m |
Data | 22 iunie 2015 16:27:02 |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Status | done |
| Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
user.cpp:39:22: error: ‘n’ was not declared in this scope
vector<int> distance(n + 1, INT_MAX);
^
user.cpp:40:22: error: ‘n’ was not declared in this scope
vector<bool> visited(n + 1, false);
^
user.cpp: In function ‘void dijkstra(int, int, int)’:
user.cpp:48:5: error: reference to ‘distance’ is ambiguous
distance[source] = 0;
^
user.cpp:39:13: note: candidates are: std::vector<int> distance
vector<int> distance(n + 1, INT_MAX);
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/ostream:38,
from /usr/include/c++/4.8/iostream:39,
from user.cpp:21:
/usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)
distance(_InputIterator __first, _InputIterator __last)
^
user.cpp:49:31: error: reference to ‘distance’ is ambiguous
pq.push(make_pair(source, distance[source]));
^
user.cpp:39:13: note: candidates are: std::vector<int> distance
vector<int> distance(n + 1, INT_MAX);
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/ostream:38,
from /usr/include/c++/4.8/iostream:39,
from user.cpp:21:
/usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)
distance(_InputIterator __first, _InputIterator __last)
^
user.cpp:65:17: error: reference to ‘distance’ is ambiguous
if (distance[y] > distance[x] + cost) {
^
user.cpp:39:13: note: candidates are: std::vector<int> distance
vector<int> distance(n + 1, INT_MAX);
^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/ostream:38,
from /usr/include/c++/4.8/iostream:39,
from user.cpp:21:
/usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
