Pagini recente » Borderou de evaluare (job #1000974) | Borderou de evaluare (job #2137510) | Borderou de evaluare (job #1525153) | Borderou de evaluare (job #2551749) | Borderou de evaluare (job #2820167)
Borderou de evaluare (job #2820167)
Raport evaluator
Compilare:
main.cpp: In member function 'bool Graph::hakimi(std::vector<int>)':
main.cpp:63:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | for(int i = 0; i < v.size(); i++){
| ~~^~~~~~~~~~
main.cpp:65: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]
65 | if(v[i] >= v.size()) return false;
main.cpp: In member function 'virtual void Unoriented_graph::DFS(int, std::vector<int>&)':
main.cpp:152:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
152 | for(int i = 0; i < this->m_adjancency_list[node].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Unoriented_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:235:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
235 | for(int i = 0; i < this->m_adjancency_list[current_node].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Unoriented_graph::DFSCriticals(int, int&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<int> >&)':
main.cpp:304:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
304 | for(int i = 0; i < m_adjancency_list[current_node].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Unoriented_graph_coupler::DFSCoupler(int, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
main.cpp:441:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
441 | 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:562:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
562 | 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:632:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
632 | 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:702:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
702 | 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:815: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]
815 | 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:831: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]
831 | 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:904:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
904 | while((index * 2 <= heap.size() - 1 && distances[ heap[index] ] > distances[ heap[index * 2] ]) ||
| ~~~~~~~~~~^~~~~~~~~~~~~~~~~~
main.cpp:905:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
905 | (index * 2 + 1 <= heap.size() - 1 && distances[ heap[index] ] > distances[ heap[index * 2 + 1] ])){
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
main.cpp:909:89: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | OK | 5 |
2 | 2ms | 184kb | OK | 5 |
3 | 2ms | 184kb | OK | 5 |
4 | 2ms | 184kb | OK | 5 |
5 | 2ms | 184kb | OK | 5 |
6 | 2ms | 184kb | OK | 5 |
7 | 59ms | 7061kb | OK | 5 |
8 | 54ms | 7012kb | OK | 5 |
9 | 25ms | 1949kb | OK | 5 |
10 | 20ms | 1941kb | OK | 5 |
11 | 25ms | 1916kb | OK | 5 |
12 | 20ms | 1945kb | OK | 5 |
13 | 21ms | 1945kb | OK | 5 |
14 | 21ms | 1851kb | OK | 5 |
15 | 474ms | 31744kb | OK | 5 |
16 | 407ms | 31678kb | OK | 5 |
17 | 315ms | 31698kb | OK | 5 |
18 | 609ms | 31772kb | OK | 5 |
19 | 464ms | 31653kb | OK | 5 |
20 | 585ms | 31657kb | OK | 5 |
Punctaj total | 100 |