Borderou de evaluare (job #2803215)

Utilizator DenisTroacaDenis Troaca DenisTroaca Data 19 noiembrie 2021 17:29:43
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 60

Raport evaluator

Compilare: main.cpp: In member function 'std::vector<int> Graph::bfs(int)': main.cpp:105:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 105 | for (int i = 0; i < neighbors[aux.front()].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)': main.cpp:142:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 142 | 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:189:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 189 | 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:252:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 252 | 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:307:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 307 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)': main.cpp:323: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] 323 | 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:366:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 366 | for (int i = 0; i < neighbors[x].size(); i++) | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::apm(int&)': main.cpp:428:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 428 | for(int j =0; j < neighbors[next_node].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:469:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 469 | for(int i =0; i < aux.size(); i++){ | ~~^~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::apm(int&)': main.cpp:431:52: warning: 'next_node' may be used uninitialized in this function [-Wmaybe-uninitialized] 431 | parents[ neighbors[next_node][j] ] = next_node;
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbCorect10
21ms184kbCorect10
31ms184kbCorect10
41ms184kbCorect10
51ms184kbCorect10
61001ms5181kbTime limit exceeded0
71002ms12865kbTime limit exceeded0
81001ms2396kbTime limit exceeded0
991ms1970kbCorect10
101001ms9449kbTime limit exceeded0
Punctaj total60

Ceva nu functioneaza?