Borderou de evaluare (job #2818363)

Utilizator popaandaioanaPopa Anda-Ioana popaandaioana Data 15 decembrie 2021 22:18:29
Problema Ciclu hamiltonian de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 15

Raport evaluator

Compilare: main.cpp: In member function 'void graf::construire_graf(int)': main.cpp:53:15: warning: unused variable 'cost' [-Wunused-variable] 53 | int u, v, cost; | ^~~~ main.cpp: In member function 'void graf::bfs(int)': main.cpp:114:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 114 | 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:151:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 151 | 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: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 member function 'void graf::compTC(int, std::vector<int>*, bool*, int&)': main.cpp:275:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 275 | 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:311:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 311 | 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:389:13: warning: unused variable 'dist' [-Wunused-variable] 389 | int dist = s.begin() -> first; | ^~~~ main.cpp: In member function 'void graf::bellmanford()': main.cpp:487:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 487 | for(int k = 0; k < vecini[coada.front()].size(); k ++) | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void graf::ciclu_eulerian()': main.cpp:670:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 670 | for(int i = 0; i < rasp.size() - 1; i ++) | ~~^~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:712:9: warning: unused variable 's' [-Wunused-variable] 712 | int s, n, m; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms184kbIncorect0
22ms184kbIncorect0
32ms184kbOK5
42ms184kbIncorect0
52ms184kbIncorect0
62ms184kbIncorect0
730ms6578kbOK5
830ms6578kbOK5
916ms2297kbIncorect0
1015ms2379kbIncorect0
1116ms2297kbIncorect0
1216ms2297kbIncorect0
1316ms2297kbIncorect0
1416ms2314kbIncorect0
15331ms19050kbIncorect0
16269ms18911kbIncorect0
17186ms19165kbIncorect0
18458ms19173kbIncorect0
19318ms19054kbIncorect0
20432ms19058kbIncorect0
Punctaj total15

Ceva nu functioneaza?