Borderou de evaluare (job #3190472)
Utilizator | Data | 7 ianuarie 2024 17:19:44 | |
---|---|---|---|
Problema | Cc | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'bool bellmanFord(int, int, int)':
main.cpp:14:10: error: reference to 'distance' is ambiguous
14 | fill(distance, distance + nodes, INT_MAX);
| ^~~~~~~~
In file included from /usr/include/c++/12.2.1/bits/stl_construct.h:62,
from /usr/include/c++/12.2.1/bits/char_traits.h:46,
from /usr/include/c++/12.2.1/ios:40,
from /usr/include/c++/12.2.1/ostream:38,
from /usr/include/c++/12.2.1/iostream:39,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/stl_iterator_base_funcs.h:147:5: note: candidates are: 'template<class _InputIterator> constexpr typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)'
147 | distance(_InputIterator __first, _InputIterator __last)
| ^~~~~~~~
main.cpp:10:84: note: 'int distance [205]'
10 | int cost[MAX_NODES][MAX_NODES], capacity[MAX_NODES][MAX_NODES], parent[MAX_NODES], distance[MAX_NODES];
| ^~~~~~~~
main.cpp:14:20: error: reference to 'distance' is ambiguous
14 | fill(distance, distance + nodes, INT_MAX);
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator_base_funcs.h:147:5: note: candidates are: 'template<class _InputIterator> constexpr typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)'
147 | distance(_InputIterator __first, _InputIterator __last)
| ^~~~~~~~
main.cpp:10:84: note: 'int distance [205]'
10 | int cost[MAX_NODES][MAX_NODES], capacity[MAX_NODES][MAX_NODES], parent[MAX_NODES], distance[MAX_NODES];
| ^~~~~~~~
main.cpp:18:5: error: reference to 'distance' is ambiguous
18 | distance[source] = 0;
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator_base_funcs.h:147:5: note: candidates are: 'template<class _InputIterator> constexpr typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)'
147 | distance(_InputIterator __first, _InputIterator __last)
| ^~~~~~~~
main.cpp:10:84: note: 'int distance [205]'
10 | int cost[MAX_NODES][MAX_NODES], capacity[MAX_NODES][MAX_NODES], parent[MAX_NODES], distance[MAX_NODES];
| ^~~~~~~~
main.cpp:26:39: error: reference to 'distance' is ambiguous
26 | if (capacity[u][v] > 0 && distance[v] > distance[u] + cost[u][v]) {
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator_base_funcs.h:147:5: note: candidates are: 'template<class _InputIterator> constexpr typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)'
147 | distance(_InputIterator __first, _InputIterator __last)
| ^~~~~~~~
main.cpp:10:84: note: 'int distance [205]'
10 | int cost[MAX_NODES][MAX_NODES], capacity[MAX_NODES][MAX_NODES], parent[MAX_NODES], distance[MAX_NODES];
| ^~~~~~~~
main.cpp:26:53: error: reference to 'distance' is ambiguous
26 | if (capacity[u][v] > 0 && distance[v] > distance[u] + cost[u][v]) {
| ^~~~~~~~
/usr/include/c++/12.2.1/bits/stl_iterator_base_funcs.h:147:5: note: candidates are: 'template<class _InputIterator> constexpr typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator)'
147 | distance(_InputIterator __first, _InputIterator __last)
| ^~~~~~~~
main.cpp:10:84: note: 'int distance [205]'
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !