Borderou de evaluare (job #2831380)

Utilizator tandiToader Andi tandi Data 11 ianuarie 2022 11:54:55
Problema BFS - Parcurgere in latime Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::dfs_ctc(int, std::vector<std::vector<int> >&, std::vector<int>&, std::stack<int>&)': main.cpp:172:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 172 | for (int j = 0; j < adj_list[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::transpose(int, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<std::vector<int> >&, int)': main.cpp:183:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 183 | for (int j = 0; j < adj_list_trans[varf].size(); j++) // aleg mereu primul vecin nevizitat anterior al varfului curent | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::strongly_connected_components(std::ifstream&, std::ofstream&)': main.cpp:225:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 225 | for (int j = 0; j < strongly_con_comp[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::hamilton()': main.cpp:280:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 280 | for (int k = 0; k < adj_list_costs[j].size(); k++) // Get through all the neighbours of the node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:292:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 292 | for (int i = 0; i < adj_list_costs[0].size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::tree_diameter(int, int&, int&)': main.cpp:355:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 355 | for (int i = 0; i < adj_list[parent_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bellman_ford(int)': main.cpp:387:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 387 | for (int i = 0; i < adj_list_costs[source].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:546:7: warning: unused variable 'ok' [-Wunused-variable] 546 | int ok = 1; | ^~ main.cpp:655:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 655 | for (int i = 0; i < euler_list.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
46ms286kbOK10
511ms446kbOK10
654ms2084kbOK10
7169ms5193kbOK10
8164ms8314kbOK10
9822ms14123kbOK10
10821ms14086kbOK10
Punctaj total100

Ceva nu functioneaza?