0_0_23301223_666.cpp: In function 'void dfs(int, int, int)':
0_0_23301223_666.cpp:26:3: error: reference to 'prev' is ambiguous
prev[v] = p;
^
0_0_23301223_666.cpp:21:18: note: candidates are: int prev [1200]
int depth[maxn], prev[maxn];
^
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++/algorithm:61,
from 0_0_23301223_666.cpp:1:
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_23301223_666.cpp: In function 'int parent(int)':
0_0_23301223_666.cpp:34:28: error: reference to 'prev' is ambiguous
int parent(int a) { return prev[a] >= 0 ? endpoint(prev[a], a) : -1; }
^
0_0_23301223_666.cpp:21:18: note: candidates are: int prev [1200]
int depth[maxn], prev[maxn];
^
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++/algorithm:61,
from 0_0_23301223_666.cpp:1:
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_23301223_666.cpp:34:52: error: reference to 'prev' is ambiguous
int parent(int a) { return prev[a] >= 0 ? endpoint(prev[a], a) : -1; }
^
0_0_23301223_666.cpp:21:18: note: candidates are: int prev [1200]
int depth[maxn], prev[maxn];
^
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++/algorithm:61,
from 0_0_23301223_666.cpp:1:
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_23301223_666.cpp: In function 'bool find_cycle(int, std::vector<int>&)':
0_0_23301223_666.cpp:42:21: error: reference to 'prev' is ambiguous
cycle.push_back(prev[b]);
^
0_0_23301223_666.cpp:21:18: note: candidates are: int prev [1200]
int depth[maxn], prev[maxn];
^
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++/algorithm:61,
from 0_0_23301223_666.cpp:1:
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
^
|
