Pagini recente » Borderou de evaluare (job #556857) | Borderou de evaluare (job #1860426) | Borderou de evaluare (job #2504993) | Borderou de evaluare (job #1040732) | Borderou de evaluare (job #2819856)
Borderou de evaluare (job #2819856)
Raport evaluator
Compilare:
main.cpp: In member function 'std::vector<int> Graph::bfs(int)':
main.cpp:147:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
147 | for (int i = 0; i < neighbors[aux.front()].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfs(int, std::vector<bool>&)':
main.cpp:184:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
184 | 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:231:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
231 | 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:294:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
294 | 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:349:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
349 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::havel_hakimi(std::vector<int>&)':
main.cpp:365: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]
365 | 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:408:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
408 | for (int i = 0; i < neighbors[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::apm(int&)':
main.cpp:520:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
520 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::dijkstra()':
main.cpp:559:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
559 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:570:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
570 | for (int i = 0; i < distances.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bellman_ford()':
main.cpp:602:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
602 | for (int i = 0; i < neighbors[current_node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::max_flow(int, int)':
main.cpp:646:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
646 | for (int j = 0; j < neighbors[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::darb_bfs(int&)':
main.cpp:752:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
752 | for (int i = 0; i < neighbors[aux.front()].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 184kb | Raspuns corect! | 10 | 10 |
2 | 2ms | 184kb | Raspuns corect! | 10 | 10 |
3 | 6ms | 462kb | Raspuns corect! | 10 | 10 |
4 | 59ms | 5640kb | Raspuns corect! | 10 | 10 |
5 | 182ms | 65556kb | Memory limit exceeded | 0 | 0 |
6 | 337ms | 65556kb | Memory limit exceeded | 0 | 0 |
7 | 125ms | 6828kb | Raspuns corect! | 10 | 0 |
8 | 414ms | 65556kb | Memory limit exceeded | 0 |
9 | 396ms | 65556kb | Memory limit exceeded | 0 | 0 |
10 | 477ms | 65544kb | Memory limit exceeded | 0 |
Punctaj total | 40 |