Pagini recente » Borderou de evaluare (job #1536114) | Borderou de evaluare (job #1870680) | Borderou de evaluare (job #1537579) | Borderou de evaluare (job #913697) | Borderou de evaluare (job #2822305)
Borderou de evaluare (job #2822305)
Raport evaluator
Compilare:
main.cpp: In member function 'void Graf::functie1(std::vector<int>*, std::vector<std::vector<int> >&)':
main.cpp:63:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | for(int i = 0; i < connections.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graf::dijkstra2(int, std::vector<std::vector<std::pair<int, int> > >&)':
main.cpp:147:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
147 | for(int i = 1; i < lista_adiacenta2[b].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<int> Graf::bellman_ford2(int, std::vector<std::vector<std::pair<int, int> > >&)':
main.cpp:184:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
184 | for(int i = 1; i < lista_adiacenta2[b].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::bfs(int)':
main.cpp:315:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
315 | for(int i = 0; i < lista_adiacenta[nod_curent].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::dfs(std::vector<int>&, int)':
main.cpp:369:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
369 | for(int i = 0; i < lista_adiacenta[nod].size(); i++) // verificam nodurile adiacente cu nodul curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::parcurgere(std::vector<std::vector<int> >&)':
main.cpp:423:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
423 | for(int j = 0; j < componenta[i].size(); j++) // afisam elementele sale
| ~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::dfs1(int, std::unordered_map<int, bool>&, std::vector<int>&)':
main.cpp:435:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
435 | for(int i = 0; i < lista_adiacenta[nod].size(); i++) // pentru fiecare nod adiacent cu nodul curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::dfs2(int, std::unordered_map<int, bool>&, std::vector<int>&, int, std::vector<std::vector<int> >&, std::vector<std::vector<int> >&)':
main.cpp:449:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
449 | for(int i = 0; i < lista_adiacenta1[nod].size(); i++) // pentru fiecare nod adiacent cu nodul curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::havel_hakimi()':
main.cpp:485:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
485 | if(grade.size() < x)
| ~~~~~~~~~~~~~^~~
main.cpp: In member function 'void Graf::functie(int, int*, std::stack<int>&)':
main.cpp:549:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
549 | for(int i = 0; i < lista_adiacenta[nod].size(); i++) // verificam nodurile adiacente cu nodul curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::dfs_biconex1()':
main.cpp:585:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
585 | for(int j = 0; j < componente_biconexe[i].size(); j++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf::dfs_biconex2(int, int, int&, std::stack<int>&, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
main.cpp:598:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
598 | for(int i = 0; i < lista_adiacenta[x].size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:602:15: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
602 | if(parinte != y)
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 204ms | 134381kb | Time limit exceeded | 0 |
2 | 200ms | 132136kb | Time limit exceeded | 0 |
3 | 204ms | 134393kb | Time limit exceeded | 0 |
4 | 201ms | 132354kb | Time limit exceeded | 0 |
5 | 200ms | 132157kb | Time limit exceeded | 0 |
6 | 204ms | 134492kb | Time limit exceeded | 0 |
7 | 203ms | 134443kb | Time limit exceeded | 0 |
8 | 201ms | 131964kb | Time limit exceeded | 0 |
9 | 200ms | 132055kb | Time limit exceeded | 0 |
10 | 203ms | 134479kb | Time limit exceeded | 0 |
11 | 204ms | 134381kb | Time limit exceeded | 0 |
12 | 200ms | 132149kb | Time limit exceeded | 0 |
13 | 200ms | 131780kb | Time limit exceeded | 0 |
14 | 200ms | 132206kb | Time limit exceeded | 0 |
15 | 200ms | 131899kb | Time limit exceeded | 0 |
16 | 200ms | 132485kb | Time limit exceeded | 0 |
17 | 204ms | 134463kb | Time limit exceeded | 0 |
18 | 200ms | 132485kb | Time limit exceeded | 0 |
19 | 204ms | 134160kb | Time limit exceeded | 0 |
20 | 202ms | 131866kb | Time limit exceeded | 0 |
Punctaj total | 0 |