Borderou de evaluare (job #1705812)
Utilizator | Data | 20 mai 2016 23:45:48 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void makeSet(long int)’:
user.cpp:24:5: error: reference to ‘rank’ is ambiguous
rank[x] = 0;
^
user.cpp:10:6: note: candidates are: long int rank [200001]
long rank[200001];
^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
from /usr/include/c++/4.8/bits/stl_pair.h:59,
from /usr/include/c++/4.8/bits/stl_algobase.h:64,
from /usr/include/c++/4.8/vector:60,
from user.cpp:2:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp: In function ‘void setUnion(long int, long int)’:
user.cpp:44:9: error: reference to ‘rank’ is ambiguous
if (rank[xRoot] < rank[yRoot]) {
^
user.cpp:10:6: note: candidates are: long int rank [200001]
long rank[200001];
^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
from /usr/include/c++/4.8/bits/stl_pair.h:59,
from /usr/include/c++/4.8/bits/stl_algobase.h:64,
from /usr/include/c++/4.8/vector:60,
from user.cpp:2:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp:44:23: error: reference to ‘rank’ is ambiguous
if (rank[xRoot] < rank[yRoot]) {
^
user.cpp:10:6: note: candidates are: long int rank [200001]
long rank[200001];
^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
from /usr/include/c++/4.8/bits/stl_pair.h:59,
from /usr/include/c++/4.8/bits/stl_algobase.h:64,
from /usr/include/c++/4.8/vector:60,
from user.cpp:2:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp:47:14: error: reference to ‘rank’ is ambiguous
else if (rank[xRoot] > rank[yRoot]) {
^
user.cpp:10:6: note: candidates are: long int rank [200001]
long rank[200001];
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !