Borderou de evaluare (job #2805715)

Utilizator popaandaioanaPopa Anda-Ioana popaandaioana Data 21 noiembrie 2021 19:43:07
Problema Componente biconexe Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In member function 'void graf::construire_graf(int)': main.cpp:44:15: warning: unused variable 'cost' [-Wunused-variable] 44 | int u, v, cost; | ^~~~ main.cpp: In member function 'void graf::bfs(int)': main.cpp:105:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 105 | 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*, std::stack<int>)': main.cpp:124:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 124 | for(int i = 0; i < lista[nod].size(); i ++) //parcurgem lista de vecini a lui nod | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::compTC(int, std::vector<int>*, bool*, int&)': main.cpp:222:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 222 | for(int i = 0; i < lista1[nod].size(); i ++) //pt. fiecare nod i din care se poate ajunge in nod | ~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::CtareC()': main.cpp:263:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 263 | for (int j = 0; j < ctc[i].size(); j ++) | ~~^~~~~~~~~~~~~~~ main.cpp: In function 'bool Havel_Hakimi(std::vector<int>&, int)': main.cpp:295:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 295 | 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:373:13: warning: unused variable 'dist' [-Wunused-variable] 373 | int dist = s.begin() -> first; | ^~~~ main.cpp: In function 'int main()': main.cpp:504:10: warning: unused variable 's' [-Wunused-variable] 504 | int s, n, m; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
110ms7393kbCorect10
29ms7933kbCorect10
310ms7385kbCorect10
410ms7516kbCorect10
510ms8441kbCorect10
620ms8777kbCorect10
730ms8519kbCorect10
8328ms27394kbCorect10
9233ms50671kbCorect10
10290ms36016kbCorect10
Punctaj total100

Ceva nu functioneaza?