Borderou de evaluare (job #2805767)

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

Raport evaluator

Compilare: main.cpp: In member function 'void graf::construire_graf(int)': main.cpp:46:15: warning: unused variable 'cost' [-Wunused-variable] 46 | int u, v, cost; | ^~~~ main.cpp: In member function 'void graf::bfs(int)': main.cpp:107:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 107 | 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:144:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 144 | 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:253:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 253 | 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:265:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 265 | 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:301:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 301 | 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:379:13: warning: unused variable 'dist' [-Wunused-variable] 379 | int dist = s.begin() -> first; | ^~~~ main.cpp: In function 'int main()': main.cpp:510:10: warning: unused variable 's' [-Wunused-variable] 510 | int s, n, m; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
136ms31776kbCost incorect0
237ms31776kbMuchia nu se gaseste in graful initial0
335ms31789kbCost incorect0
435ms31793kbCost incorect0
537ms31801kbCost incorect0
6165ms35209kbCost incorect0
7289ms38060kbCost incorect0
879ms33128kbCost incorect0
980ms33214kbCost incorect0
10260ms37113kbCost incorect0
Punctaj total0

Ceva nu functioneaza?