Borderou de evaluare (job #1657782)
Utilizator | Data | 20 martie 2016 19:56:10 | |
---|---|---|---|
Problema | Subsir crescator maximal | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp:9:6: error: field ‘parent’ has incomplete type
Node parent;
^
user.cpp: In function ‘void makeset(long int)’:
user.cpp:16:5: error: ‘struct Node’ has no member named ‘parent’
nod.parent=nod;
^
user.cpp: In function ‘long int findset(Node)’:
user.cpp:23:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
user.cpp: In function ‘void unionset(long int, long int)’:
user.cpp:25:13: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
if (disj[x].parent.ranq>=disj[y].parent.ranq){
^
user.cpp:25:34: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
if (disj[x].parent.ranq>=disj[y].parent.ranq){
^
user.cpp:26:13: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
disj[y].parent=disj[x].parent;
^
user.cpp:26:28: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
disj[y].parent=disj[x].parent;
^
user.cpp:27:17: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
if (disj[x].parent.ranq==disj[y].parent.ranq) disj[x].ranq++;
^
user.cpp:27:38: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
if (disj[x].parent.ranq==disj[y].parent.ranq) disj[x].ranq++;
^
user.cpp:29:18: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
else disj[x].parent=disj[y].parent;
^
user.cpp:29:33: error: ‘std::map<long int, Node>::mapped_type’ has no member named ‘parent’
else disj[x].parent=disj[y].parent;
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !