Pagini recente » Borderou de evaluare (job #1148038) | Borderou de evaluare (job #312147) | Borderou de evaluare (job #990862) | Borderou de evaluare (job #2472363) | Borderou de evaluare (job #2805755)
Borderou de evaluare (job #2805755)
Raport evaluator
Compilare:
main.cpp: In member function 'void graf::construire_graf(int)':
main.cpp:45:15: warning: unused variable 'cost' [-Wunused-variable]
45 | int u, v, cost;
| ^~~~
main.cpp: In member function 'void graf::bfs(int)':
main.cpp:106:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
106 | 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:143:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
143 | 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:252:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
252 | 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:264:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
264 | 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:296:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
296 | 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:374:13: warning: unused variable 'dist' [-Wunused-variable]
374 | int dist = s.begin() -> first;
| ^~~~
main.cpp: In function 'int main()':
main.cpp:505:10: warning: unused variable 's' [-Wunused-variable]
505 | int s, n, m;
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 11ms | 5070kb | OK | 5 |
2 | 11ms | 5074kb | OK | 5 |
3 | 10ms | 5074kb | OK | 5 |
4 | 19ms | 5328kb | OK | 5 |
5 | 11ms | 5017kb | OK | 5 |
6 | 11ms | 5087kb | OK | 5 |
7 | 10ms | 5087kb | OK | 5 |
8 | 11ms | 5042kb | OK | 5 |
9 | 11ms | 5111kb | OK | 5 |
10 | 11ms | 5095kb | OK | 5 |
11 | 35ms | 6049kb | OK | 5 |
12 | 30ms | 5931kb | OK | 5 |
13 | 42ms | 6467kb | OK | 5 |
14 | 44ms | 6451kb | OK | 5 |
15 | 58ms | 6987kb | OK | 5 |
16 | 72ms | 7454kb | OK | 5 |
17 | 97ms | 13463kb | Incorect | 0 |
18 | 11ms | 5513kb | Incorect | 0 |
19 | 16ms | 5632kb | Incorect | 0 |
20 | 82ms | 7733kb | Incorect | 0 |
Punctaj total | 80 |