Borderou de evaluare (job #2805812)

Utilizator popaandaioanaPopa Anda-Ioana popaandaioana Data 22 noiembrie 2021 01:23:01
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: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::dijkstra()': main.cpp:383:13: warning: unused variable 'dist' [-Wunused-variable] 383 | int dist = s.begin() -> first; | ^~~~ main.cpp: In function 'int main()': main.cpp:514:10: warning: unused variable 's' [-Wunused-variable] 514 | int s, n, m; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
1504ms3850kbTime limit exceeded00
2504ms3825kbTime limit exceeded00
36ms2560kbOK55
46ms2453kbOK55
511ms3903kbOK55
610ms3813kbOK50
7503ms12685kbTime limit exceeded0
849ms4759kbOK50
959ms4849kbOK5
10342ms20500kbMemory limit exceeded0
1178ms5373kbOK520
12131ms5996kbOK5
1392ms5529kbOK5
14178ms6676kbOK5
15226ms7274kbOK50
16178ms6639kbOK5
17503ms7344kbTime limit exceeded0
18259ms7884kbOK50
19317ms8605kbOK5
20469ms20484kbMemory limit exceeded0
Punctaj total35

Ceva nu functioneaza?