Borderou de evaluare (job #2376021)
| Utilizator |  Bancila Emanuel emy953 |
Data | 8 martie 2019 13:20:57 |
|---|---|---|---|
| Problema | Arbore partial de cost minim | Status | done |
| Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void Prim(int)':
main.cpp:34:35: error: no match for 'operator[]' (operand types are 'std::priority_queue<std::pair<int, int> >' and 'int')
val=L[j].top().first; nod=L[j][i].top().second;
^
main.cpp:36:13: error: no match for 'operator[]' (operand types are 'std::priority_queue<std::pair<int, int> >' and 'int')
{ S[L[j][i].first]=val;
^
main.cpp:25:6: warning: unused variable 'k' [-Wunused-variable]
{int k,j,c,i,val,nod;
^
main.cpp:25:10: warning: unused variable 'c' [-Wunused-variable]
{int k,j,c,i,val,nod;
^
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
