Borderou de evaluare (job #2819746)

Utilizator DenisTroacaDenis Troaca DenisTroaca Data 18 decembrie 2021 22:03:01
Problema Ciclu Eulerian Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 30

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graph::bfs(int)': main.cpp:147:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 147 | for (int i = 0; i < neighbors[aux.front()].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)': main.cpp:184:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 184 | 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:231:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 231 | 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:294:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 294 | 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:349:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 349 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)': main.cpp:365: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] 365 | 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:408:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 408 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::apm(int&)': main.cpp:520:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 520 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::dijkstra()': main.cpp:559:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 559 | for (int i = 0; i < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:570:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 570 | for (int i = 0; i < distances.size(); i++) | ~~^~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::bellman_ford()': main.cpp:602:27: 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 < neighbors[current_node].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::max_flow(int, int)': main.cpp:646:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 646 | for (int j = 0; j < neighbors[i].size(); j++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Graph::darb_bfs(int&)': main.cpp:752:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 752 | for (int i = 0; i < neighbors[aux.front()].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms184kbRaspuns corect!1010
22ms184kbFisier de iesire corupt!00
321ms1003kbRaspuns corect!1010
4268ms7147kbFisier de iesire corupt!00
5603ms15851kbRaspuns corect!1010
6801ms45735kbTime limit exceeded00
7531ms20385kbRaspuns gresit!00
8803ms60432kbTime limit exceeded0
9804ms26050kbTime limit exceeded00
10802ms57520kbTime limit exceeded0
Punctaj total30

Ceva nu functioneaza?