Pagini recente » Borderou de evaluare (job #2084399) | Borderou de evaluare (job #1920895) | Borderou de evaluare (job #2188467) | Borderou de evaluare (job #1827708) | Borderou de evaluare (job #2819833)
Borderou de evaluare (job #2819833)
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:682:16: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
682 | 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:1031:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
1031 | for (int i = 1; i < rezultat.size(); i++)
| ~~^~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 188kb | Corect | 10 | 30 |
2 | 2ms | 184kb | Corect | 10 |
3 | 2ms | 184kb | Corect | 10 |
4 | 2ms | 184kb | Corect | 10 | 30 |
5 | 6ms | 360kb | Corect | 10 |
6 | 16ms | 1138kb | Corect | 10 |
7 | 25ms | 1830kb | Corect | 10 | 30 |
8 | 77ms | 4718kb | Corect | 10 |
9 | 160ms | 9965kb | Corect | 10 |
10 | 192ms | 14630kb | Corect | 10 | 10 |
Punctaj total | 100 |