0_0_18096873_24075.cpp: In function 'void addEdge(int, int, int)':
0_0_18096873_24075.cpp:14:5: error: reference to 'next' is ambiguous
next[cnt] = first[u];
^
0_0_18096873_24075.cpp:11:52: note: candidates are: int next [200100]
int T, n, value[MAXN], first[MAXN], to[MAXN << 1], next[MAXN << 1], cost[MAXN << 1], go[MAXN << 1], cnt;
^
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++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18096873_24075.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_iterator_base_funcs.h:184:5: note: template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type)
next(_ForwardIterator __x, typename
^
0_0_18096873_24075.cpp: In function 'int visitAndBack(int, int)':
0_0_18096873_24075.cpp:27:42: error: reference to 'next' is ambiguous
for(int i = first[cur]; i != -1; i = next[i]) {
^
0_0_18096873_24075.cpp:11:52: note: candidates are: int next [200100]
int T, n, value[MAXN], first[MAXN], to[MAXN << 1], next[MAXN << 1], cost[MAXN << 1], go[MAXN << 1], cnt;
^
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++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18096873_24075.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_iterator_base_funcs.h:184:5: note: template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type)
next(_ForwardIterator __x, typename
^
0_0_18096873_24075.cpp: In function 'int main()':
0_0_18096873_24075.cpp:56:52: error: reference to 'next' is ambiguous
for(int j = first[i]; j != -1; j = next[j]) {
^
0_0_18096873_24075.cpp:11:52: note: candidates are: int next [200100]
int T, n, value[MAXN], first[MAXN], to[MAXN << 1], next[MAXN << 1], cost[MAXN << 1], go[MAXN << 1], cnt;
^
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++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18096873_24075.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_iterator_base_funcs.h:184:5: note: template<class _ForwardIterator> _ForwardIterator std::next(_ForwardIterator, typename std::iterator_traits<_Iter>::difference_type)
next(_ForwardIterator __x, typename
^
|
