Borderou de evaluare (job #2806593)

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

Raport evaluator

Eroare de 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:257:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 257 | 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:269:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 269 | 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:305:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 305 | 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::prim()': main.cpp:323:13: error: 'NMAX' was not declared in this scope 323 | bitset <NMAX> viz; | ^~~~ main.cpp:323:17: error: template argument 1 is invalid 323 | bitset <NMAX> viz; | ^ main.cpp:344:15: error: invalid types 'int[int]' for array subscript 344 | if(viz[nod_curent] == 1) | ^ main.cpp:346:12: error: invalid types 'int[int]' for array subscript 346 | viz[nod_curent] = 1; | ^ main.cpp:349:16: error: invalid types 'int[int]' for array subscript 349 | if(!viz[j.first] && drum[j.first] > j.second) | ^ main.cpp: In member function 'void graf::dijkstra()': main.cpp:384:13: warning: unused variable 'dist' [-Wunused-variable] 384 | int dist = s.begin() -> first; | ^~~~ main.cpp: In member function 'void graf::bellmanford()': main.cpp:482:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 482 | for(int k = 0; k < vecini[coada.front()].size(); k ++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:502:10: warning: unused variable 's' [-Wunused-variable] Non zero exit status: 1

Ceva nu functioneaza?