Borderou de evaluare (job #2821763)

Utilizator dascalu_maraDascalu Mara Elena dascalu_mara Data 23 decembrie 2021 00:10:49
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

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:579: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] 579 | 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:623: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] 623 | 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:651:35: warning: 'sizeof' on array function parameter 'visited' will return size of 'bool*' [-Wsizeof-array-argument] 651 | memset(visited, false, sizeof(visited)); | ~^~~~~~~~ main.cpp:649:96: note: declared here 649 | bool Graph::bfsMaxFlow(int src, int dst, vector<vector<int>> residualGraph, int parent[], bool visited[]) | ~~~~~^~~~~~~~~ main.cpp:651: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] 651 | memset(visited, false, sizeof(visited)); | ^~~~~~~~~~~~~~~ main.cpp:663: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] 663 | 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:692: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] 692 | 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:771: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
111ms7426kbFisier de iesire lipsa0
211ms7446kbFisier de iesire lipsa0
310ms7376kbFisier de iesire lipsa0
411ms7393kbFisier de iesire lipsa0
511ms7454kbFisier de iesire lipsa0
611ms7344kbFisier de iesire lipsa0
711ms7344kbFisier de iesire lipsa0
811ms7385kbFisier de iesire lipsa0
911ms7356kbFisier de iesire lipsa0
1011ms7413kbFisier de iesire lipsa0
Punctaj total0

Ceva nu functioneaza?