Borderou de evaluare (job #3133016)

Utilizator tomaionutIDorando tomaionut Data 24 mai 2023 20:19:18
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In instantiation of 'void priorityQueue<T>::heapifyDown(int) [with T = Nod]': main.cpp:63:13: required from 'T priorityQueue<T>::pop() [with T = Nod]' main.cpp:133:14: required from here main.cpp:26:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Nod>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 26 | if (copilStanga < coada.size() && coada[copilStanga] < coada[copilMin]) | ~~~~~~~~~~~~^~~~~~~~~~~~~~ main.cpp:29:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Nod>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 29 | if (copilDreapta < coada.size() && coada[copilDreapta] < coada[copilMin]) | ~~~~~~~~~~~~~^~~~~~~~~~~~~~ main.cpp: In member function 'T priorityQueue<T>::top() const [with T = Nod]': main.cpp:76:5: warning: control reaches end of non-void function [-Wreturn-type] 76 | } | ^ main.cpp: In member function 'T priorityQueue<T>::pop() [with T = Nod]': main.cpp:67:5: warning: control reaches end of non-void function [-Wreturn-type] 67 | } | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms303kbIncorect0
20ms303kbIncorect0
31ms303kbIncorect0
41ms303kbIncorect0
56ms1605kbIncorect0
69ms2129kbIncorect0
714ms3198kbIncorect0
834ms6189kbIncorect0
924ms5255kbIncorect0
1074ms9805kbIncorect0
Punctaj total0

Ceva nu functioneaza?