0_0_14859202_30881.cpp: In function 'void Union(int, int, int, int&)':
0_0_14859202_30881.cpp:46:6: error: reference to 'rank' is ambiguous
if(rank[x]<=rank[y]){
^
0_0_14859202_30881.cpp:22:46: note: candidates are: int rank [20005]
int a[QueryLen],parent[NodeLen],num[NodeLen],rank[NodeLen];
^
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_14859202_30881.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note: template<class> struct std::rank
struct rank
^
0_0_14859202_30881.cpp:46:15: error: reference to 'rank' is ambiguous
if(rank[x]<=rank[y]){
^
0_0_14859202_30881.cpp:22:46: note: candidates are: int rank [20005]
int a[QueryLen],parent[NodeLen],num[NodeLen],rank[NodeLen];
^
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_14859202_30881.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note: template<class> struct std::rank
struct rank
^
0_0_14859202_30881.cpp:49:7: error: reference to 'rank' is ambiguous
if(rank[x]==rank[y])rank[y]++;
^
0_0_14859202_30881.cpp:22:46: note: candidates are: int rank [20005]
int a[QueryLen],parent[NodeLen],num[NodeLen],rank[NodeLen];
^
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_14859202_30881.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note: template<class> struct std::rank
struct rank
^
0_0_14859202_30881.cpp:49:16: error: reference to 'rank' is ambiguous
if(rank[x]==rank[y])rank[y]++;
^
0_0_14859202_30881.cpp:22:46: note: candidates are: int rank [20005]
int a[QueryLen],parent[NodeLen],num[NodeLen],rank[NodeLen];
^
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_14859202_30881.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note: template<class> struct std::rank
struct rank
^
0_0_14859202_30881.cpp:49:24: error: reference to 'rank' is ambiguous
if(rank[x]==rank[y])rank[y]++;
^
0_0_14859202_30881.cpp:22:46: note: candidates are: int rank [20005]
int a[QueryLen],parent[NodeLen],num[NodeLen],rank[NodeLen];
^
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_14859202_30881.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note: template<class> struct std::rank
struct rank
^
|
