0_0_16773315_5481.cpp: In function 'void add_edge(int, int)':
0_0_16773315_5481.cpp:143:5: error: reference to 'prev' is ambiguous
prev[edges] = last[u];
^
0_0_16773315_5481.cpp:109:36: note: candidates are: int prev [1507]
int n1, n2, m, edges, last[MXN+7], prev[MXE+7], head[MXE+7];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algobase.h:66:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/char_traits.h:39,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/istream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/sstream:38,
from 0_0_16773315_5481.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/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
^
0_0_16773315_5481.cpp: In function 'void bfs()':
0_0_16773315_5481.cpp:157:44: error: reference to 'prev' is ambiguous
for (int e = last[u1]; e >= 0; e = prev[e]){
^
0_0_16773315_5481.cpp:109:36: note: candidates are: int prev [1507]
int n1, n2, m, edges, last[MXN+7], prev[MXE+7], head[MXE+7];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algobase.h:66:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/char_traits.h:39,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/istream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/sstream:38,
from 0_0_16773315_5481.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/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
^
0_0_16773315_5481.cpp: In function 'bool dfs(int)':
0_0_16773315_5481.cpp:168:40: error: reference to 'prev' is ambiguous
for (int e = last[u1]; e >= 0; e = prev[e]){
^
0_0_16773315_5481.cpp:109:36: note: candidates are: int prev [1507]
int n1, n2, m, edges, last[MXN+7], prev[MXE+7], head[MXE+7];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algobase.h:66:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/char_traits.h:39,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/istream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/sstream:38,
from 0_0_16773315_5481.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/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
^
|