Borderou de evaluare (job #2821486)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::dfs(int, bool*)':
main.cpp:207:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
207 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::outputAdj()':
main.cpp:215:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
215 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bfsUtil(int, bool*)':
main.cpp:299:27: 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 < adj[node].size(); i++) //parcurg toti vecinii sai
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::topSort(int*, std::queue<int>)':
main.cpp:405:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
405 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)':
main.cpp:438:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
438 | if (top > degree_seq.size()) // daca valoarea primului element este mare decat numarul de elemente ramase, nu putem construi un astfel de graf
| ~~~~^~~~~~~~~~~~~~~~~~~
main.cpp:441:28: 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 < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase
| ~~^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::Dijkstra()':
main.cpp:577:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
577 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente ale lui node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::BellmanFord()':
main.cpp:616:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
616 | for (int i = 0; i < adj_weight[node].size(); i++) //pentru toate nodurile adiacente cu node
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::bfsMaxFlow(int, int, std::vector<std::vector<int> >, int*, bool*)':
main.cpp:644:35: warning: 'sizeof' on array function parameter 'visited' will return size of 'bool*' [-Wsizeof-array-argument]
644 | memset(visited, false, sizeof(visited));
| ~^~~~~~~~
main.cpp:642:96: note: declared here
642 | bool Graph::bfsMaxFlow(int src, int dst, vector<vector<int>> residualGraph, int parent[], bool visited[])
| ~~~~~^~~~~~~~~
main.cpp:644:28: warning: argument to 'sizeof' in 'void* memset(void*, int, size_t)' call is the same expression as the destination; did you mean to dereference it? [-Wsizeof-pointer-memaccess]
644 | memset(visited, false, sizeof(visited));
| ^~~~~~~~~~~~~~~
main.cpp:656:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
656 | for (int i = 0 ; i < adj_capacity[node].size(); i++) //parcurg toate nodurile adiacente cu nodul curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'int Graph::EdmondsKarp(int, int)':
main.cpp:685:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
685 | for (int j = 0; j < adj_capacity[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::dfsUtil(int, int&, int, int&, bool*)':
main.cpp:764:23: 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 | 15ms | 8228kb | Corect | 10 |
2 | 15ms | 8212kb | Corect | 10 |
3 | 15ms | 8282kb | Corect | 10 |
4 | 15ms | 8290kb | Corect | 10 |
5 | 15ms | 8232kb | Corect | 10 |
6 | 141ms | 10137kb | Corect | 10 |
7 | 241ms | 12333kb | Corect | 10 |
8 | 59ms | 9027kb | Corect | 10 |
9 | 63ms | 8974kb | Corect | 10 |
10 | 213ms | 11358kb | Corect | 10 |
Punctaj total | 100 |