Borderou de evaluare (job #2813762)

Utilizator DenisTroacaDenis Troaca DenisTroaca Data 7 decembrie 2021 11:02:38
Problema Floyd-Warshall/Roy-Floyd 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:139:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 139 | for (int i = 0; i < neighbors[aux.front()].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)': main.cpp:176:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 176 | 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:223:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 223 | 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:286:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 286 | 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:341:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 341 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)': main.cpp:357: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] 357 | 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:400:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 400 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::apm(int&)': main.cpp:511:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 511 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra()': main.cpp:550:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 550 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:561:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 561 | for (int i = 0; i < distances.size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bellman_ford()': main.cpp:593:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 593 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::max_flow(int, int)': main.cpp:658:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 658 | for(int j = 0; j < neighbors[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:721:12: warning: unused variable 'm' [-Wunused-variable] 721 | int n, m, x; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
52ms184kbOK10
62ms184kbOK10
76ms335kbOK10
86ms331kbOK10
96ms290kbOK10
1011ms372kbOK10
Punctaj total100

Ceva nu functioneaza?