Borderou de evaluare (job #2821806)

Utilizator MihaelaDanilaDanila Mihaela MihaelaDanila Data 23 decembrie 2021 01:53:25
Problema Flux maxim 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:227:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 227 | 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:243:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 243 | for(int i = 0; i < this->m_adjancency_list[node].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:340:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 340 | 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:410:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 410 | 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:577:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 577 | 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:737:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 737 | 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:809:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 809 | 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:881:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 881 | 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&)': main.cpp:1027: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] 1027 | 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>&)': main.cpp:1044: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] 1044 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Unoriented_graph_with_costs::push(int, std::vector<int>&, std::vector<int>&, std::vector<int>&)': main.cpp:1121:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 1121 | while((index * 2 <= heap.size() - 1 && distances[ heap[index] ] > distances[ heap[index * 2] ]) || | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms184kbOK1010
22ms184kbOK1010
32ms184kbOK1010
42ms184kbOK1010
52ms184kbOK1010
62ms184kbOK1010
76ms1257kbOK1010
820ms4349kbOK1030
925ms6868kbOK10
1039ms8515kbOK10
Punctaj total100

Ceva nu functioneaza?