Borderou de evaluare (job #2819159)

Utilizator Zamolxis25Sebastian Gradinaru Zamolxis25 Data 17 decembrie 2021 22:58:09
Problema BFS - Parcurgere in latime Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In constructor 'Graf::Graf(int, int, bool, std::vector<std::vector<int> >&)': main.cpp:41:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 41 | for(int j = 0; j < adjacencyList[i].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graf::bfs(int, int)': main.cpp:69:15: warning: unused variable 'n' [-Wunused-variable] 69 | const int n = m_nrNodes + 1; | ^ main.cpp:104:5: warning: 'lastVisited' may be used uninitialized in this function [-Wmaybe-uninitialized] 104 | if(lastVisited != start) return -1; | ^~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbIncorect0
22ms184kbIncorect0
32ms184kbIncorect0
416ms598kbIncorect0
5170ms917kbIncorect0
61053ms4161kbTime limit exceeded0
71052ms9457kbTime limit exceeded0
81050ms12906kbTime limit exceeded0
91052ms32657kbTime limit exceeded0
101051ms32727kbTime limit exceeded0
Punctaj total0

Ceva nu functioneaza?