Borderou de evaluare (job #2822305)

Utilizator Pop_MariaPop Maria Pop_Maria Data 23 decembrie 2021 19:57:14
Problema Parcurgere DFS - componente conexe Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

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
1204ms134381kbTime limit exceeded0
2200ms132136kbTime limit exceeded0
3204ms134393kbTime limit exceeded0
4201ms132354kbTime limit exceeded0
5200ms132157kbTime limit exceeded0
6204ms134492kbTime limit exceeded0
7203ms134443kbTime limit exceeded0
8201ms131964kbTime limit exceeded0
9200ms132055kbTime limit exceeded0
10203ms134479kbTime limit exceeded0
11204ms134381kbTime limit exceeded0
12200ms132149kbTime limit exceeded0
13200ms131780kbTime limit exceeded0
14200ms132206kbTime limit exceeded0
15200ms131899kbTime limit exceeded0
16200ms132485kbTime limit exceeded0
17204ms134463kbTime limit exceeded0
18200ms132485kbTime limit exceeded0
19204ms134160kbTime limit exceeded0
20202ms131866kbTime limit exceeded0
Punctaj total0

Ceva nu functioneaza?