Borderou de evaluare (job #2831276)

Utilizator tandiToader Andi tandi Data 11 ianuarie 2022 00:31:08
Problema Algoritmul Bellman-Ford 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:171:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 171 | 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:182:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 182 | 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:224:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 224 | for (int j = 0; j < strongly_con_comp[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::hamilton()': main.cpp:279: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] 279 | for (int k = 0; k < adj_list_costs[j].size(); k++) // Get through all the neighbours of the node | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:291: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] 291 | for (int i = 0; i < adj_list_costs[0].size(); ++i) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bellman_ford(int)': main.cpp:359: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] 359 | for (int i = 0; i < adj_list_costs[source].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:518:7: warning: unused variable 'ok' [-Wunused-variable] 518 | int ok = 1; | ^~ main.cpp:602:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 602 | for (int i = 0; i < euler_list.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms184kbOK55
22ms184kbOK55
32ms184kbOK55
42ms184kbOK55
51ms184kbOK55
62ms184kbOK510
76ms282kbOK5
849ms1904kbOK515
949ms1675kbOK5
106ms200kbOK5
1178ms3117kbOK520
12121ms3022kbOK5
1388ms2850kbOK5
14164ms3964kbOK5
15212ms4722kbOK515
16169ms4116kbOK5
1721ms303kbOK5
18250ms6369kbOK515
19302ms7073kbOK5
2035ms323kbOK5
Punctaj total100

Ceva nu functioneaza?