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_13424483_7041.cpp: In function 'void add(int, int)':
0_0_13424483_7041.cpp:14:2: error: reference to 'next' is ambiguous
  next[++cnt]=son[x]; son[x]=cnt; ed[cnt]=y;
  ^
0_0_13424483_7041.cpp:8:9: note: candidates are: int next [500001]
 int cnt,next[500001],son[500001],ed[500001];
         ^
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_13424483_7041.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_13424483_7041.cpp: In function 'void dfs(int)':
0_0_13424483_7041.cpp:20:24: error: reference to 'next' is ambiguous
  for (int j=son[u];j;j=next[j])
                        ^
0_0_13424483_7041.cpp:8:9: note: candidates are: int next [500001]
 int cnt,next[500001],son[500001],ed[500001];
         ^
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_13424483_7041.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_13424483_7041.cpp: In function 'int main()':
0_0_13424483_7041.cpp:204:121: error: reference to 'next' is ambiguous
   for (int i=1;i<=500000;i++) zson[i]=root[i]=len[i]=son[i]=wh[i]=id[i]=top[i]=fa[i]=size[i]=h[i]=ff[i]=lazy_[i]=vis[i]=next[i]=ed[i]=c1[i]=c2[i]=lazy[i]=f1[i]=f2[i]=lson[i]=rson[i]=0;
                                                                                                                         ^
0_0_13424483_7041.cpp:8:9: note: candidates are: int next [500001]
 int cnt,next[500001],son[500001],ed[500001];
         ^
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_13424483_7041.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-15 07:03:19, Gzip enabled