Borderou de evaluare (job #2822015)

Utilizator popaandaioanaPopa Anda-Ioana popaandaioana Data 23 decembrie 2021 14:43:38
Problema Parcurgere DFS - componente conexe Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 80

Raport evaluator

Compilare: main.cpp: In member function 'void graf::construire_graf(int)': main.cpp:56:15: warning: unused variable 'cost' [-Wunused-variable] 56 | int u, v, cost; | ^~~~ main.cpp: In member function 'void graf::bfs(int)': main.cpp:117:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 117 | for(int i = 0; i < lista[nod_s].size(); i++) //parcurgem lista de adiacenta a nodului nod_s | ~~^~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::dfs(int, bool*)': main.cpp:154:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 154 | for(int i = 0; i < lista[nod].size(); i ++) //parcurgem lista de vecini a lui nod | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::CtareC()': main.cpp:266:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 266 | for (int j = 0; j < ctc[i].size(); j ++) | ~~^~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::compTC(int, std::vector<int>*, bool*, int&)': main.cpp:278:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 278 | for(int i = 0; i < lista1[nod].size(); i ++) //pt. fiecare nod i din care se poate ajunge in nod | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'bool Havel_Hakimi(std::vector<int>&, int)': main.cpp:324:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 324 | if (a > x.size()) //verificam daca avem suficiente elem. in vector. Daca nu => nu se poate crea graful | ~~^~~~~~~~~~ main.cpp: In member function 'void graf::dijkstra()': main.cpp:402:13: warning: unused variable 'dist' [-Wunused-variable] 402 | int dist = s.begin() -> first; | ^~~~ main.cpp: In member function 'void graf::bellmanford()': main.cpp:500:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 500 | for(int k = 0; k < vecini[coada.front()].size(); k ++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::ciclu_eulerian()': main.cpp:683:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 683 | for(int i = 0; i < rasp.size() - 1; i ++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:777:9: warning: unused variable 's' [-Wunused-variable] 777 | int s, n, m; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
111ms5070kbOK5
211ms5058kbOK5
36ms3686kbOK5
416ms5271kbOK5
511ms5074kbOK5
611ms5079kbOK5
711ms5001kbOK5
811ms5079kbOK5
911ms5099kbOK5
1010ms5046kbOK5
1135ms6049kbOK5
1230ms5910kbOK5
1344ms6492kbOK5
1444ms6438kbOK5
1558ms6995kbOK5
1673ms7426kbOK5
1797ms13574kbIncorect0
1811ms5500kbIncorect0
1916ms5652kbIncorect0
2082ms7745kbIncorect0
Punctaj total80

Ceva nu functioneaza?