Pagini recente » Borderou de evaluare (job #1882088) | Borderou de evaluare (job #2394013) | Borderou de evaluare (job #2177967) | Borderou de evaluare (job #2139871) | Borderou de evaluare (job #2805793)
Borderou de evaluare (job #2805793)
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:254:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
254 | 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:266:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
266 | 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:302:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
302 | 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:380:13: warning: unused variable 'dist' [-Wunused-variable]
380 | int dist = s.begin() -> first;
| ^~~~
main.cpp: In function 'int main()':
main.cpp:511:10: warning: unused variable 's' [-Wunused-variable]
511 | int s, n, m;
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 10ms | 3842kb | OK | 10 |
2 | 6ms | 2584kb | OK | 10 |
3 | 11ms | 3883kb | OK | 10 |
4 | 11ms | 3891kb | OK | 10 |
5 | 35ms | 4419kb | OK | 10 |
6 | 59ms | 4845kb | OK | 10 |
7 | 78ms | 5214kb | OK | 10 |
8 | 174ms | 6909kb | OK | 10 |
9 | 116ms | 6344kb | OK | 10 |
10 | 366ms | 9117kb | OK | 10 |
Punctaj total | 100 |