Borderou de evaluare (job #2821848)

Utilizator MihaelaDanilaDanila Mihaela MihaelaDanila Data 23 decembrie 2021 05:15:26
Problema Diametrul unui arbore Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'bool Graph::hakimi(std::vector<int>)': main.cpp:102:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 102 | for(int i = 0; i < v.size(); i++){ | ~~^~~~~~~~~~ main.cpp:104:17: 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] 104 | if(v[i] >= v.size()) return false; main.cpp: In member function 'virtual void Undirected_graph::DFS(int)': main.cpp:237:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 237 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'virtual void Undirected_graph::DFS(int, std::vector<int>&)': main.cpp:253:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 253 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Undirected_graph::set_adjacency_list(std::vector<std::vector<int> >)': main.cpp:268:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 268 | for(int i = 0 ; i < connections.size() ; i++){ | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Undirected_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:363:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 363 | for(int i = 0; i < this->m_adjancency_list[current_node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Undirected_graph::DFSCriticals(int, int&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:431:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 431 | for(int i = 0; i < m_adjancency_list[current_node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Undirected_graph_coupler::DFSCoupler(int, std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:616:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 616 | for(int i = 0; i < m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:637:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 637 | for(int i = 0; i < m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'virtual std::vector<int> Oriented_graph::BFS(int)': main.cpp:803:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 803 | for(int i=0; i < this->m_adjancency_list[curent].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Oriented_graph::tarjan(int, std::stack<int>&, std::vector<int>&, std::vector<int>&, int&, std::vector<int>&, std::vector<std::vector<int> >&)': main.cpp:875:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 875 | for(int i=0; i<this->m_adjancency_list[node].size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Oriented_graph::DFS_topological_sort(int, std::stack<int>&, std::vector<int>&)': main.cpp:947:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 947 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'std::vector<std::pair<int, int> > Unoriented_graph_with_costs::prim(int, int&)': main.cpp:1093: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] 1093 | for(int j = 0; j < this->m_adjancency_list[root].size(); j++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Unoriented_graph_with_costs::introduce_in_APM(int, std::vector<int>&, std::vector<int>&)':
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbOK10
22ms184kbOK10
32ms184kbOK10
42ms184kbOK10
511ms937kbOK10
644ms2637kbOK10
768ms3637kbOK10
8116ms5435kbOK10
983ms6176kbOK10
10163ms7016kbOK10
Punctaj total100

Ceva nu functioneaza?