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_18005478_17480.cpp: In function 'void addEdge(int, int)':
0_0_18005478_17480.cpp:57:5: error: reference to 'next' is ambiguous
     next[e] = head[a];
     ^
0_0_18005478_17480.cpp:53:23: note: candidates are: int next [200010]
 int head[N], v[N<<1], next[N<<1], e, vis[N];     
                       ^
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++/vector:60,
                 from 0_0_18005478_17480.cpp:3:
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_18005478_17480.cpp: In function 'void findRoot(int, int)':
0_0_18005478_17480.cpp:10:51: error: reference to 'next' is ambiguous
 #define ree(i, now) for(int i=head[now]; i!=-1; i=next[i])
                                                   ^
0_0_18005478_17480.cpp:66:5: note: in expansion of macro 'ree'
     ree(i, now) if(v[i]!=pre && !vis[v[i]]){
     ^
0_0_18005478_17480.cpp:53:23: note: candidates are: int next [200010]
 int head[N], v[N<<1], next[N<<1], e, vis[N];     
                       ^
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++/vector:60,
                 from 0_0_18005478_17480.cpp:3:
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_18005478_17480.cpp: In function 'void deep2Root(int, int, int)':
0_0_18005478_17480.cpp:10:51: error: reference to 'next' is ambiguous
 #define ree(i, now) for(int i=head[now]; i!=-1; i=next[i])
                                                   ^
0_0_18005478_17480.cpp:85:5: note: in expansion of macro 'ree'
     ree(i, now) if(v[i]!=pre && !vis[v[i]]){
     ^
0_0_18005478_17480.cpp:53:23: note: candidates are: int next [200010]
 int head[N], v[N<<1], next[N<<1], e, vis[N];     
                       ^
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++/vector:60,
                 from 0_0_18005478_17480.cpp:3:
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_18005478_17480.cpp: In function 'void dfs(int, int, int)':
0_0_18005478_17480.cpp:10:51: error: reference to 'next' is ambiguous
 #define ree(i, now) for(int i=head[now]; i!=-1; i=next[i])
                                                   ^
0_0_18005478_17480.cpp:106:5: note: in expansion of macro 'ree'
     ree(i, root) if(v[i]!=pre && !vis[v[i]]){
     ^
0_0_18005478_17480.cpp:53:23: note: candidates are: int next [200010]
 int head[N], v[N<<1], next[N<<1], e, vis[N];     
                       ^
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++/vector:60,
                 from 0_0_18005478_17480.cpp:3:
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
     ^


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-28 20:43:30, Gzip enabled