Pagini recente » Borderou de evaluare (job #533853) | Borderou de evaluare (job #2216885) | Borderou de evaluare (job #2978132) | Borderou de evaluare (job #2544878) | Borderou de evaluare (job #2806598)
Borderou de evaluare (job #2806598)
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: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]
502 | int s, n, m;
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 22ms | 19431kb | Corect | 10 |
2 | 23ms | 19431kb | Corect | 10 |
3 | 24ms | 19435kb | Corect | 10 |
4 | 25ms | 19435kb | Corect | 10 |
5 | 23ms | 19435kb | Corect | 10 |
6 | 236ms | 23613kb | Corect | 10 |
7 | 486ms | 27938kb | Corect | 10 |
8 | 96ms | 21049kb | Corect | 10 |
9 | 81ms | 21057kb | Corect | 10 |
10 | 428ms | 26406kb | Corect | 10 |
Punctaj total | 100 |