Pagini recente » Borderou de evaluare (job #2019266) | Borderou de evaluare (job #444214) | Borderou de evaluare (job #1629113) | Cod sursa (job #3273167) | Borderou de evaluare (job #2814039)
Borderou de evaluare (job #2814039)
Raport evaluator
Compilare:
main.cpp: In member function 'std::vector<int> Graph::bfs(int)':
main.cpp:143:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
143 | for (int i = 0; i < neighbors[aux.front()].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)':
main.cpp:180:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
180 | 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:227:23: 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 < 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:290:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
290 | 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:345:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
345 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)':
main.cpp:361: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]
361 | 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:404:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
404 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::apm(int&)':
main.cpp:515:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
515 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::dijkstra()':
main.cpp:554:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
554 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:565:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
565 | for (int i = 0; i < distances.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bellman_ford()':
main.cpp:597:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
597 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::max_flow(int, int)':
main.cpp:640:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
640 | for (int j = 0; j < neighbors[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::darb_bfs(int&)':
main.cpp:737:27: 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 < neighbors[aux.front()].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 184kb | OK | 10 |
| 2 | 2ms | 184kb | OK | 10 |
| 3 | 2ms | 184kb | OK | 10 |
| 4 | 2ms | 184kb | OK | 10 |
| 5 | 11ms | 1011kb | OK | 10 |
| 6 | 53ms | 3608kb | OK | 10 |
| 7 | 78ms | 4911kb | OK | 10 |
| 8 | 130ms | 7442kb | OK | 10 |
| 9 | 101ms | 8445kb | OK | 10 |
| 10 | 173ms | 9490kb | OK | 10 |
| Punctaj total | 100 |