Borderou de evaluare (job #2805791)

Utilizator popaandaioanaPopa Anda-Ioana popaandaioana Data 21 noiembrie 2021 22:47:39
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 10

Raport evaluator

Compilare: main.cpp: In member function 'void graf::construire_graf(int)': main.cpp:47:15: warning: unused variable 'cost' [-Wunused-variable] 47 | int u, v, cost; | ^~~~ main.cpp: In member function 'void graf::bfs(int)': main.cpp:108:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 108 | 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:145:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 145 | 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:254:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 254 | 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:266:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 266 | 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:302:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 302 | 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:380:13: warning: unused variable 'dist' [-Wunused-variable] 380 | int dist = s.begin() -> first; | ^~~~ main.cpp: In function 'int main()': main.cpp:511:10: warning: unused variable 's' [-Wunused-variable] 511 | int s, n, m; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
124ms21172kbCost incorect0
224ms21172kbCorect10
321ms21176kbCost incorect0
428ms21282kbCost incorect0
528ms21291kbCost incorect0
6151ms24608kbCost incorect0
7282ms27213kbCost incorect0
872ms22593kbCost incorect0
970ms22777kbCost incorect0
10253ms26451kbCost incorect0
Punctaj total10

Ceva nu functioneaza?