Borderou de evaluare (job #3244097)
Utilizator | Data | 23 septembrie 2024 16:18:21 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void dijkstra(int)':
main.cpp:39:31: error: 'struct HeapNode' has no member named 'cost'
39 | if(!dist[top.nod]<top.cost)
| ^~~~
main.cpp:39:26: warning: logical not is only applied to the left hand side of comparison [-Wlogical-not-parentheses]
39 | if(!dist[top.nod]<top.cost)
| ^
main.cpp:39:12: note: add parentheses around left hand side expression to silence this warning
39 | if(!dist[top.nod]<top.cost)
| ^~~~~~~~~~~~~~
| ( )
main.cpp:42:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<drum>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for(int i=0; i<matad[top.nod].size(); i++)
| ~^~~~~~~~~~~~~~~~~~~~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !