Borderou de evaluare (job #1506202)
| Utilizator |  theprdv theprdv |
Data | 20 octombrie 2015 10:11:37 |
|---|---|---|---|
| Problema | Secvmax | Status | done |
| Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int UNION(int, int)’:
user.cpp:35:9: error: reference to ‘rank’ is ambiguous
if (rank[x] < rank[y]){
^
user.cpp:13:14: note: candidates are: int rank [100000]
int T[MAXN], rank[MAXN];
^
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:35:19: error: reference to ‘rank’ is ambiguous
if (rank[x] < rank[y]){
^
user.cpp:13:14: note: candidates are: int rank [100000]
int T[MAXN], rank[MAXN];
^
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:43:9: error: reference to ‘rank’ is ambiguous
if (rank[x] == rank[y]) ++rank[x];
^
user.cpp:13:14: note: candidates are: int rank [100000]
int T[MAXN], rank[MAXN];
^
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:43:20: error: reference to ‘rank’ is ambiguous
if (rank[x] == rank[y]) ++rank[x];
^
user.cpp:13:14: note: candidates are: int rank [100000]
int T[MAXN], rank[MAXN];
^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
