Borderou de evaluare (job #1534842)
Utilizator | Data | 23 noiembrie 2015 23:53:07 | |
---|---|---|---|
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 ‘int main()’:
user.cpp:31:9: error: reference to ‘rank’ is ambiguous
rank[i] = 1;
^
user.cpp:7:21: note: candidates are: int rank [200001]
int parent[200001], 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/utility:70,
from /usr/include/c++/4.8/algorithm:60,
from user.cpp:2:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp:36:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < edges.size(); ++i) {
^
user.cpp:40:17: error: reference to ‘rank’ is ambiguous
if (rank[rx] > rank[ry]) {
^
user.cpp:7:21: note: candidates are: int rank [200001]
int parent[200001], 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/utility:70,
from /usr/include/c++/4.8/algorithm:60,
from user.cpp:2:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp:40:28: error: reference to ‘rank’ is ambiguous
if (rank[rx] > rank[ry]) {
^
user.cpp:7:21: note: candidates are: int rank [200001]
int parent[200001], 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/utility:70,
from /usr/include/c++/4.8/algorithm:60,
from user.cpp:2:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp:42:17: error: reference to ‘rank’ is ambiguous
rank[rx] += rank[ry];
^
user.cpp:7:21: note: candidates are: int rank [200001]
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !