Borderou de evaluare (job #2831662)

Utilizator tandiToader Andi tandi Data 11 ianuarie 2022 20:51:53
Problema Parcurgere DFS - componente conexe Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 15

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:185:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 185 | for (int j = 0; j < adj_list[varf].size(); j++) // choose the first neighbour and compute DFS | ~~^~~~~~~~~~~~~~~~~~~~~~~ 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:196:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 196 | for (int j = 0; j < adj_list_trans[varf].size(); j++) // choose the first neighbour and compute DFS | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::strongly_connected_components(std::ifstream&, std::ofstream&)': main.cpp:238:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 238 | for (int j = 0; j < strongly_con_comp[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::hamilton()': main.cpp:293: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] 293 | for (int k = 0; k < adj_list_costs[j].size(); k++) // Get through all the neighbours of the node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:305: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] 305 | 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:368:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 368 | 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:400: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] 400 | for (int i = 0; i < adj_list_costs[source].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:572:7: warning: unused variable 'ok' [-Wunused-variable] 572 | int ok = 1; | ^~ main.cpp:685:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 685 | for (int i = 0; i < euler_list.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbIncorect0
22ms184kbIncorect0
32ms184kbOK5
411ms344kbOK5
52ms184kbIncorect0
63ms184kbIncorect0
72ms184kbIncorect0
82ms184kbIncorect0
92ms184kbIncorect0
102ms184kbIncorect0
1125ms1368kbIncorect0
1220ms1626kbIncorect0
1330ms2449kbIncorect0
1435ms3604kbIncorect0
1540ms3743kbIncorect0
1654ms4452kbIncorect0
1788ms13488kbOK5
1815ms5472kbIncorect0
1915ms5492kbIncorect0
2063ms6651kbIncorect0
Punctaj total15

Ceva nu functioneaza?