Borderou de evaluare (job #2805787)

Utilizator popaandaioanaPopa Anda-Ioana popaandaioana Data 21 noiembrie 2021 22:40:06
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 35

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 Punctaj/grupa
1504ms3756kbTime limit exceeded00
2504ms3850kbTime limit exceeded00
36ms2514kbOK55
46ms2547kbOK55
511ms3846kbOK55
610ms3821kbOK50
7502ms12763kbTime limit exceeded0
849ms4632kbOK50
954ms4825kbOK5
10343ms20500kbMemory limit exceeded0
1178ms5373kbOK520
12131ms5984kbOK5
1392ms5505kbOK5
14178ms6668kbOK5
15227ms7274kbOK50
16178ms6639kbOK5
17502ms7340kbTime limit exceeded0
18260ms7868kbOK50
19317ms8581kbOK5
20469ms20484kbMemory limit exceeded0
Punctaj total35

Ceva nu functioneaza?