F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_13304246_10476.cpp: In function 'void add(int, int)':
0_0_13304246_10476.cpp:17:15: error: reference to 'next' is ambiguous
   go[++cnt]=v;next[cnt]=end[u];end[u]=cnt;
               ^
0_0_13304246_10476.cpp:5:72: note: candidates are: int next [100005]
 /*A tree*/int size[N],f[N],top[N],index[N],go[N],son[N],end[N],deep[N],next[N];int 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/stl_tree.h:61,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:60,
                 from 0_0_13304246_10476.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_13304246_10476.cpp:17:25: error: reference to 'end' is ambiguous
   go[++cnt]=v;next[cnt]=end[u];end[u]=cnt;
                         ^
0_0_13304246_10476.cpp:5:57: note: candidates are: int end [100005]
 /*A tree*/int size[N],f[N],top[N],index[N],go[N],son[N],end[N],deep[N],next[N];int cnt;
                                                         ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:51:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/stdexcept:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/array:38,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/tuple:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:63,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61,
                 from 0_0_13304246_10476.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:97:5: note:                 template<class _Tp, long long unsigned int _Nm> _Tp* std::end(_Tp (&)[_Nm])
     end(_Tp (&__arr)[_Nm])
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:78:5: note:                 template<class _Container> decltype (__cont.end()) std::end(const _Container&)
     end(const _Container& __cont) -> decltype(__cont.end())
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:68:5: note:                 template<class _Container> decltype (__cont.end()) std::end(_Container&)
     end(_Container& __cont) -> decltype(__cont.end())
     ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:62:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61,
                 from 0_0_13304246_10476.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/initializer_list:99:5: note:                 template<class _Tp> constexpr const _Tp* std::end(std::initializer_list<_Tp>)
     end(initializer_list<_Tp> __ils) noexcept
     ^
0_0_13304246_10476.cpp:17:32: error: reference to 'end' is ambiguous
   go[++cnt]=v;next[cnt]=end[u];end[u]=cnt;
                                ^
0_0_13304246_10476.cpp:5:57: note: candidates are: int end [100005]
 /*A tree*/int size[N],f[N],top[N],index[N],go[N],son[N],end[N],deep[N],next[N];int cnt;
                                                         ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:51:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/stdexcept:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/array:38,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/tuple:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:63,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61,
                 from 0_0_13304246_10476.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:97:5: note:                 template<class _Tp, long long unsigned int _Nm> _Tp* std::end(_Tp (&)[_Nm])
     end(_Tp (&__arr)[_Nm])
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:78:5: note:                 template<class _Container> decltype (__cont.end()) std::end(const _Container&)
     end(const _Container& __cont) -> decltype(__cont.end())
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:68:5: note:                 template<class _Container> decltype (__cont.end()) std::end(_Container&)
     end(_Container& __cont) -> decltype(__cont.end())
     ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:62:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61,
                 from 0_0_13304246_10476.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/initializer_list:99:5: note:                 template<class _Tp> constexpr const _Tp* std::end(std::initializer_list<_Tp>)
     end(initializer_list<_Tp> __ils) noexcept
     ^
0_0_13304246_10476.cpp: In function 'void dfs1(int)':
0_0_13304246_10476.cpp:22:14: error: reference to 'end' is ambiguous
   for (int i=end[k];i;i=next[i])
              ^
0_0_13304246_10476.cpp:5:57: note: candidates are: int end [100005]
 /*A tree*/int size[N],f[N],top[N],index[N],go[N],son[N],end[N],deep[N],next[N];int cnt;
                                                         ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:51:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/stdexcept:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/array:38,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/tuple:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:63,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61,
                 from 0_0_13304246_10476.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:97:5: note:                 template<class _Tp, long long unsigned int _Nm> _Tp* std::end(_Tp (&)[_Nm])
     end(_Tp (&__arr)[_Nm])
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:78:5: note:                 template<class _Container> decltype (__cont.end()) std::end(const _Container&)
     end(const _Container& __cont) -> decltype(__cont.end())
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:68:5: note:                 template<class _Container> decltype (__cont.end()) std::end(_Container&)
     end(_Container& __cont) -> decltype(__cont.end())
     ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:62:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61,
                 from 0_0_13304246_10476.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/initializer_list:99:5: note:                 template<class _Tp> constexpr const _Tp* std::end(std::initializer_list<_Tp>)
     end(initializer_list<_Tp> __ils) noexcept
     ^
0_0_13304246_10476.cpp:22:25: error: reference to 'next' is ambiguous
   for (int i=end[k];i;i=next[i])
                         ^
0_0_13304246_10476.cpp:5:72: note: candidates are: int next [100005]
 /*A tree*/int size[N],f[N],top[N],index[N],go[N],son[N],end[N],deep[N],next[N];int 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/stl_tree.h:61,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:60,
                 from 0_0_13304246_10476.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_13304246_10476.cpp: In function 'void dfs2(int, int)':
0_0_13304246_10476.cpp:35:14: error: reference to 'end' is ambiguous
   for (int i=end[k];i;i=next[i])
              ^
0_0_13304246_10476.cpp:5:57: note: candidates are: int end [100005]
 /*A tree*/int size[N],f[N],top[N],index[N],go[N],son[N],end[N],deep[N],next[N];int cnt;
                                                         ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:51:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/stdexcept:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/array:38,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/tuple:39,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:63,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61,
                 from 0_0_13304246_10476.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:97:5: note:                 template<class _Tp, long long unsigned int _Nm> _Tp* std::end(_Tp (&)[_Nm])
     end(_Tp (&__arr)[_Nm])
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/range_access.h:78:5: note:                 template<class _Container> decltype (__cont.end()) std::end(const _Container&)
     end(const _Container& __cont) -> declt


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-26 10:04:53, Gzip enabled