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_15969753_26281.cpp: In function 'void Add_Edge(int, int)':
0_0_15969753_26281.cpp:28:2: error: reference to 'next' is ambiguous
  next[idx] = head[f]; to[idx] = t; head[f] = idx++;
  ^
0_0_15969753_26281.cpp:13:32: note: candidates are: int next [1000004]
 int head[maxn], to[maxn << 1], next[maxn << 1], idx;
                                ^
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_15969753_26281.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_15969753_26281.cpp:29:2: error: reference to 'next' is ambiguous
  next[idx] = head[t]; to[idx] = f; head[t] = idx++;
  ^
0_0_15969753_26281.cpp:13:32: note: candidates are: int next [1000004]
 int head[maxn], to[maxn << 1], next[maxn << 1], idx;
                                ^
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_15969753_26281.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_15969753_26281.cpp: In function 'void dfs1(int, int, int)':
0_0_15969753_26281.cpp:37:31: error: reference to 'next' is ambiguous
  for(int i = head[u]; ~i; i = next[i])
                               ^
0_0_15969753_26281.cpp:13:32: note: candidates are: int next [1000004]
 int head[maxn], to[maxn << 1], next[maxn << 1], idx;
                                ^
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_15969753_26281.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_15969753_26281.cpp: In function 'void dfs2(int, int)':
0_0_15969753_26281.cpp:52:2: error: reference to 'rank' is ambiguous
  rank[tid[u]] = u;
  ^
0_0_15969753_26281.cpp:14:16: note: candidates are: int rank [500002]
 int tid[maxn], rank[maxn], tim;
                ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_15969753_26281.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_15969753_26281.cpp:55:31: error: reference to 'next' is ambiguous
  for(int i = head[u]; ~i; i = next[i])
                               ^
0_0_15969753_26281.cpp:13:32: note: candidates are: int next [1000004]
 int head[maxn], to[maxn << 1], next[maxn << 1], idx;
                                ^
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_15969753_26281.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_15969753_26281.cpp: In function 'void build(int, int, int)':
0_0_15969753_26281.cpp:89:17: error: reference to 'rank' is ambiguous
   sum[rt] = num[rank[l]];
                 ^
0_0_15969753_26281.cpp:14:16: note: candidates are: int rank [500002]
 int tid[maxn], rank[maxn], tim;
                ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_15969753_26281.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^


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-12-27 01:44:28, Gzip enabled