Pagini recente » Borderou de evaluare (job #2167567) | Borderou de evaluare (job #2039221) | Borderou de evaluare (job #2401615) | Borderou de evaluare (job #800004) | Borderou de evaluare (job #2820701)
Borderou de evaluare (job #2820701)
Raport evaluator
Compilare:
main.cpp: In member function 'std::vector<int> Graph::bfs(int)':
main.cpp:148:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
148 | for (int i = 0; i < neighbors[aux.front()].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)':
main.cpp:185:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
185 | 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:232:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
232 | 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:295:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
295 | 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:350:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
350 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)':
main.cpp:366: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]
366 | 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:409:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
409 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::apm(int&)':
main.cpp:521:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
521 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::dijkstra()':
main.cpp:560:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
560 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:571:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
571 | for (int i = 0; i < distances.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bellman_ford()':
main.cpp:603:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
603 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::max_flow(int, int)':
main.cpp:647:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
647 | for (int j = 0; j < neighbors[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::darb_bfs(int&)':
main.cpp:753:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
753 | 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 | 2ms | 184kb | OK | 5 |
5 | 2ms | 184kb | OK | 5 |
6 | 2ms | 184kb | OK | 5 |
7 | 39ms | 4386kb | OK | 5 |
8 | 35ms | 4464kb | OK | 5 |
9 | 20ms | 1077kb | OK | 5 |
10 | 16ms | 1167kb | OK | 5 |
11 | 16ms | 1118kb | OK | 5 |
12 | 21ms | 1179kb | OK | 5 |
13 | 20ms | 1081kb | OK | 5 |
14 | 20ms | 1179kb | OK | 5 |
15 | 379ms | 19181kb | OK | 5 |
16 | 316ms | 19091kb | OK | 5 |
17 | 233ms | 19173kb | OK | 5 |
18 | 525ms | 19066kb | OK | 5 |
19 | 364ms | 19095kb | OK | 5 |
20 | 496ms | 19124kb | OK | 5 |
Punctaj total | 100 |