Pagini recente » Borderou de evaluare (job #1140797) | Borderou de evaluare (job #950516) | Borderou de evaluare (job #1628352) | Borderou de evaluare (job #531743) | Borderou de evaluare (job #2806093)
Borderou de evaluare (job #2806093)
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 member function 'void graf::bellmanford()':
main.cpp:481:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
481 | for(int k = 0; k < vecini[coada.front()].size(); k ++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:501:10: warning: unused variable 's' [-Wunused-variable]
501 | int s, n, m;
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 11ms | 4997kb | OK | 5 | 5 |
2 | 11ms | 4960kb | OK | 5 | 5 |
3 | 11ms | 4956kb | OK | 5 | 5 |
4 | 11ms | 5001kb | OK | 5 | 5 |
5 | 11ms | 5054kb | OK | 5 | 5 |
6 | 11ms | 5058kb | OK | 5 | 10 |
7 | 11ms | 5058kb | OK | 5 |
8 | 64ms | 6377kb | OK | 5 | 15 |
9 | 68ms | 6201kb | OK | 5 |
10 | 15ms | 5091kb | OK | 5 |
11 | 111ms | 7528kb | OK | 5 | 20 |
12 | 159ms | 7446kb | OK | 5 |
13 | 116ms | 7081kb | OK | 5 |
14 | 216ms | 8146kb | OK | 5 |
15 | 278ms | 8871kb | OK | 5 | 15 |
16 | 221ms | 8290kb | OK | 5 |
17 | 20ms | 5128kb | OK | 5 |
18 | 321ms | 9572kb | OK | 5 | 15 |
19 | 391ms | 10293kb | OK | 5 |
20 | 25ms | 5369kb | OK | 5 |
Punctaj total | 100 |