Borderou de evaluare (job #2805755)

Utilizator popaandaioanaPopa Anda-Ioana popaandaioana Data 21 noiembrie 2021 21:34:04
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:45:15: warning: unused variable 'cost' [-Wunused-variable] 45 | int u, v, cost; | ^~~~ main.cpp: In member function 'void graf::bfs(int)': main.cpp:106:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 106 | 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:143:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 143 | 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:252:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 252 | 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:264:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 264 | 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:296:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 296 | 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:374:13: warning: unused variable 'dist' [-Wunused-variable] 374 | int dist = s.begin() -> first; | ^~~~ main.cpp: In function 'int main()': main.cpp:505:10: warning: unused variable 's' [-Wunused-variable] 505 | int s, n, m; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
111ms5070kbOK5
211ms5074kbOK5
310ms5074kbOK5
419ms5328kbOK5
511ms5017kbOK5
611ms5087kbOK5
710ms5087kbOK5
811ms5042kbOK5
911ms5111kbOK5
1011ms5095kbOK5
1135ms6049kbOK5
1230ms5931kbOK5
1342ms6467kbOK5
1444ms6451kbOK5
1558ms6987kbOK5
1672ms7454kbOK5
1797ms13463kbIncorect0
1811ms5513kbIncorect0
1916ms5632kbIncorect0
2082ms7733kbIncorect0
Punctaj total80

Ceva nu functioneaza?