Pagini recente » Borderou de evaluare (job #3043851) | Borderou de evaluare (job #2771808) | Borderou de evaluare (job #1845050) | Borderou de evaluare (job #2708782) | Borderou de evaluare (job #2822331)
Borderou de evaluare (job #2822331)
Raport evaluator
Compilare:
main.cpp: In member function 'std::vector<int> Graph::bfs(int)':
main.cpp:152:27: 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 < neighbors[aux.front()].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)':
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::biconnected_dfs(int, int&, std::vector<int>&, std::vector<int>&, std::stack<int>&, std::vector<std::vector<int> >&, std::vector<int>&)':
main.cpp:236:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
236 | 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:299:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
299 | 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:354:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
354 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)':
main.cpp:370: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]
370 | 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:413:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
413 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::apm(int&)':
main.cpp:525:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
525 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::dijkstra()':
main.cpp:564:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
564 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:575:23: 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 < distances.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bellman_ford()':
main.cpp:607:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
607 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::max_flow(int, int)':
main.cpp:651:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
651 | for (int j = 0; j < neighbors[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::darb_bfs(int&)':
main.cpp:757:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
757 | for (int i = 0; i < neighbors[aux.front()].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 184kb | OK | 5 |
2 | 2ms | 184kb | OK | 5 |
3 | 2ms | 184kb | OK | 5 |
4 | 11ms | 417kb | OK | 5 |
5 | 2ms | 184kb | OK | 5 |
6 | 2ms | 184kb | OK | 5 |
7 | 2ms | 184kb | OK | 5 |
8 | 2ms | 184kb | OK | 5 |
9 | 2ms | 184kb | OK | 5 |
10 | 2ms | 184kb | OK | 5 |
11 | 30ms | 1757kb | OK | 5 |
12 | 25ms | 2068kb | OK | 5 |
13 | 40ms | 2899kb | OK | 5 |
14 | 49ms | 3919kb | OK | 5 |
15 | 63ms | 4366kb | OK | 5 |
16 | 78ms | 5238kb | OK | 5 |
17 | 111ms | 13783kb | OK | 5 |
18 | 25ms | 7196kb | OK | 5 |
19 | 25ms | 7200kb | OK | 5 |
20 | 92ms | 7995kb | OK | 5 |
Punctaj total | 100 |