Borderou de evaluare (job #2806856)

Utilizator MihaelaDanilaDanila Mihaela MihaelaDanila Data 23 noiembrie 2021 08:58:38
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 80

Raport evaluator

Compilare: main.cpp: In member function 'void Graph::DFS(int, std::vector<int>&)': main.cpp:177:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 177 | for(int i = 0; i < this->graph_adjacency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::print_Biconnected_Components(char*)': main.cpp:194:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::unordered_set<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 194 | for(int i=0; i<biconnected_components.size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::print_Strongly_Connected_Components(char*)': main.cpp:211:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 211 | for(int i = 0; i < strongly_connected_components.size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:213:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 213 | for(int j = 0; j < strongly_connected_components[i].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::print_Critical_Edges(char*)': main.cpp:270:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 270 | for(int i = 0; i < critical_edges.size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp:272:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 272 | for(int j = 0; j<critical_edges[i].size(); j++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<int> Graph::create_Minimum_Paths(int)': main.cpp:348:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 348 | for(int i=0; i < this->graph_adjacency_list[curent].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFSBiconnected(int, int, int, std::vector<int>&, std::vector<int>&, std::vector<std::unordered_set<int> >&, std::stack<std::pair<int, int> >&)': main.cpp:426:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 426 | for(int i=0; i<this->graph_adjacency_list[nodCurent].size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::tarjan(int, std::stack<int>&, std::vector<int>&, std::vector<int>&, int&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:524:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 524 | for(int i=0; i<this->graph_adjacency_list[nod].size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFSSortareTopologica(int, std::vector<int>&, std::stack<int>&)': main.cpp:575:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 575 | for(int i=0; i<this->graph_adjacency_list[nod].size();i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::DFSCriticals(int, int&, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:652:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 652 | for(int i = 0; i < graph_adjacency_list[nodCurent].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, int> > Graph::create_APM(int&)': main.cpp:718:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 718 | for(int j = 0; j < this->graph_adjacency_list_with_costs[rad].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graph::introduce_in_APM(int, std::vector<int>&, std::vector<int>&)': main.cpp:729:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 729 | for(int i = 0; i < this->graph_adjacency_list_with_costs[nod].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbCorect10
22ms184kbCorect10
32ms184kbCorect10
41ms184kbCorect10
52ms184kbCorect10
6941ms4866kbCorect10
71003ms9023kbTime limit exceeded0
8223ms2207kbCorect10
964ms1925kbCorect10
101004ms7376kbTime limit exceeded0
Punctaj total80

Ceva nu functioneaza?