Borderou de evaluare (job #2819863)
Raport evaluator
Compilare:
main.cpp: In member function 'std::vector<int> Graf::BFS(int)':
main.cpp:197:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
197 | for (int i = 0; i < lsAd[nodCrt].size(); i++)///trec prin toate nodurile adiacente
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graf::BellmanFord(std::ifstream&, std::vector<int>&)':
main.cpp:678:16: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
678 | if (cost[vecin.first] > cost[nodCrt] + vecin.second) //vecin.first -> nodul catre care duce arcul // vecin.second -> costul arcului
| ^
main.cpp: In function 'void problemaBFS()':
main.cpp:1027:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
1027 | for (int i = 1; i < rezultat.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 184kb | OK | 10 |
| 2 | 2ms | 184kb | OK | 10 |
| 3 | 2ms | 184kb | OK | 10 |
| 4 | 2ms | 184kb | OK | 10 |
| 5 | 6ms | 507kb | OK | 10 |
| 6 | 11ms | 696kb | OK | 10 |
| 7 | 21ms | 1462kb | OK | 10 |
| 8 | 30ms | 1933kb | OK | 10 |
| 9 | 69ms | 3575kb | OK | 10 |
| 10 | 102ms | 4370kb | OK | 10 |
| Punctaj total | 100 |