Borderou de evaluare (job #2820701)

Utilizator DenisTroacaDenis Troaca DenisTroaca Data 21 decembrie 2021 11:42:07
Problema Ciclu hamiltonian de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graph::bfs(int)': main.cpp:148:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 148 | for (int i = 0; i < neighbors[aux.front()].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)': main.cpp:185:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 185 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::biconnected_dfs(int, int&, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<std::vector<int> >&, std::vector<int>&)': main.cpp:232:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 232 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::stronglyconnected_dfs(int, int&, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<std::vector<int> >&, std::vector<bool>&)': main.cpp:295:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 295 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::topological_dfs(int, std::vector<bool>&, std::stack<int>&)': main.cpp:350:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 350 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)': main.cpp:366:24: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 366 | if (degrees[0] > degrees.size() - 1) //gradul unui nod este mai mare decat nr de noduri disponibile main.cpp: In member function 'void Graph::cconnections_dfs(int, int&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:409:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 409 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::apm(int&)': main.cpp:521:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 521 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra()': main.cpp:560:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 560 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:571:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 571 | for (int i = 0; i < distances.size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bellman_ford()': main.cpp:603:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 603 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::max_flow(int, int)': main.cpp:647:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 647 | for (int j = 0; j < neighbors[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::darb_bfs(int&)': main.cpp:753:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 753 | for (int i = 0; i < neighbors[aux.front()].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK5
22ms184kbOK5
32ms184kbOK5
42ms184kbOK5
52ms184kbOK5
62ms184kbOK5
739ms4386kbOK5
835ms4464kbOK5
920ms1077kbOK5
1016ms1167kbOK5
1116ms1118kbOK5
1221ms1179kbOK5
1320ms1081kbOK5
1420ms1179kbOK5
15379ms19181kbOK5
16316ms19091kbOK5
17233ms19173kbOK5
18525ms19066kbOK5
19364ms19095kbOK5
20496ms19124kbOK5
Punctaj total100

Ceva nu functioneaza?