Borderou de evaluare (job #2196587)

Utilizator AntonescuAlexandruAntonescu Alex AntonescuAlexandru Data 19 aprilie 2018 19:19:34
Problema BFS - Parcurgere in latime Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In member function ‘void Graph::remove_edge(int, int)’: user.cpp:45:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (i = 0; i < nodes[src].neighbors.size(); i++) ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ user.cpp:48:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (i = 0; i < nodes[dst].neighbors.size(); i++) ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ user.cpp: In member function ‘bool Graph::has_edge(int, int)’: user.cpp:55:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (i = 0; i < nodes[src].neighbors.size(); i++) ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ user.cpp: In function ‘void bfs(Graph&, int, std::vector<int>&, std::vector<bool>&)’: user.cpp:94:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i < viz.size(); i++) { ~~^~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms1384kbOK10
20ms1380kbOK10
30ms1384kbOK10
44ms1452kbOK10
512ms1540kbOK10
656ms2292kbOK10
7164ms3624kbOK10
8152ms4384kbOK10
9820ms10192kbOK10
10816ms10184kbOK10
Punctaj total100

Ceva nu functioneaza?