Borderou de evaluare (job #1111644)
| Utilizator |  theo .c Theory |
Data | 19 februarie 2014 00:37:34 |
|---|---|---|---|
| Problema | Ratina | Status | done |
| Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void dfs(Trie*, int)’:
user.cpp:81:5: error: reference to ‘prev’ is ambiguous
prev[nod -> in] = euler[0];
^
user.cpp:23:62: note: candidates are: int prev [200009]
int query[QMAX]; int euler[SMAX * 2]; int niv[SMAX * 2]; int prev[SMAX]; int getIndex[NMAX]; int level[SMAX];
^
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: In function ‘int LCA(int, int)’:
user.cpp:95:14: error: reference to ‘prev’ is ambiguous
int st = prev[X]; int dr = prev[Y];
^
user.cpp:23:62: note: candidates are: int prev [200009]
int query[QMAX]; int euler[SMAX * 2]; int niv[SMAX * 2]; int prev[SMAX]; int getIndex[NMAX]; int level[SMAX];
^
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:95:32: error: reference to ‘prev’ is ambiguous
int st = prev[X]; int dr = prev[Y];
^
user.cpp:23:62: note: candidates are: int prev [200009]
int query[QMAX]; int euler[SMAX * 2]; int niv[SMAX * 2]; int prev[SMAX]; int getIndex[NMAX]; int level[SMAX];
^
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: In function ‘int main()’:
user.cpp:117:21: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
fin >> S[i] + 1;
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
