Borderou de evaluare (job #1070297)
Utilizator | Data | 31 decembrie 2013 16:33:27 | |
---|---|---|---|
Problema | Reinvent | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int bfs()’:
user.cpp:39:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < L[nod].size(); i++) {
^
user.cpp:45:5: error: reference to ‘prev’ is ambiguous
prev[vecin] = nod;
^
user.cpp:12:40: note: candidates are: int prev [100005]
int n, m, x, dist[MAX_N], from[MAX_N], prev[MAX_N];
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0,
from /usr/local/include/c++/4.8.0/bits/char_traits.h:39,
from /usr/local/include/c++/4.8.0/ios:40,
from /usr/local/include/c++/4.8.0/istream:38,
from /usr/local/include/c++/4.8.0/fstream:38,
from user.cpp:1:
/usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
user.cpp:48:24: error: reference to ‘prev’ is ambiguous
} else if (vecin != prev[nod] && X[from[vecin]] && from[vecin] != from[nod]) {
^
user.cpp:12:40: note: candidates are: int prev [100005]
int n, m, x, dist[MAX_N], from[MAX_N], prev[MAX_N];
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_algobase.h:66:0,
from /usr/local/include/c++/4.8.0/bits/char_traits.h:39,
from /usr/local/include/c++/4.8.0/ios:40,
from /usr/local/include/c++/4.8.0/istream:38,
from /usr/local/include/c++/4.8.0/fstream:38,
from user.cpp:1:
/usr/local/include/c++/4.8.0/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
prev(_BidirectionalIterator __x, typename
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !