Pagini recente » Borderou de evaluare (job #2860518) | Borderou de evaluare (job #165781) | Borderou de evaluare (job #1752646) | Borderou de evaluare (job #576540) | Borderou de evaluare (job #2821764)
Borderou de evaluare (job #2821764)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graph::dfs(int, bool*)':
main.cpp:210:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
210 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graph::outputAdj()':
main.cpp:218:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
218 | for (int i = 0; i < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::bfsUtil(int, bool*)':
main.cpp:302:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
302 | 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:408:27: 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 < adj[node].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool Graph::graphExists(std::vector<int>)':
main.cpp:441:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
441 | 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:444:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
444 | for (int i = 0 ; i < degree_seq.size(); i++) //dupa eliminarea primului element, scadem gradul "nodurilor" ramase
| ~~^~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graph::dijkstra(int)':
main.cpp:590: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]
590 | 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:634: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]
634 | 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:662:35: warning: 'sizeof' on array function parameter 'visited' will return size of 'bool*' [-Wsizeof-array-argument]
662 | memset(visited, false, sizeof(visited));
| ~^~~~~~~~
main.cpp:660:96: note: declared here
660 | bool Graph::bfsMaxFlow(int src, int dst, vector<vector<int>> residualGraph, int parent[], bool visited[])
| ~~~~~^~~~~~~~~
main.cpp:662: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]
662 | memset(visited, false, sizeof(visited));
| ^~~~~~~~~~~~~~~
main.cpp:674: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]
674 | 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:703: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]
703 | 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:782: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 | 11ms | 7446kb | OK | 10 |
2 | 10ms | 7352kb | OK | 10 |
3 | 15ms | 7491kb | OK | 10 |
4 | 15ms | 7634kb | OK | 10 |
5 | 35ms | 8032kb | OK | 10 |
6 | 59ms | 8527kb | OK | 10 |
7 | 73ms | 8802kb | OK | 10 |
8 | 172ms | 10297kb | OK | 10 |
9 | 121ms | 9981kb | OK | 10 |
10 | 303ms | 12279kb | OK | 10 |
Punctaj total | 100 |