Borderou de evaluare (job #2790799)

Utilizator MihaelaDanilaDanila Mihaela MihaelaDanila Data 29 octombrie 2021 15:54:39
Problema BFS - Parcurgere in latime Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 0

Raport evaluator

Compilare: main.cpp: In function 'std::istream& operator>>(std::istream&, Graf&)': main.cpp:33:5: warning: no return statement in function returning non-void [-Wreturn-type] 33 | } | ^ main.cpp: In function 'std::ostream& operator<<(std::ostream&, Graf&)': main.cpp:39:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 39 | for(int j=0; j<graf.m_listAdiacenta[i].size(); j++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:46:5: warning: no return statement in function returning non-void [-Wreturn-type] 46 | } | ^ main.cpp: In member function 'void Graf::BFS(int)': main.cpp:66:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 66 | for(int i=0; i < this->m_listAdiacenta[curent].size(); i++){ | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Graf::parcurgeAdancime(int, int*)': main.cpp:87:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 87 | for(int i=0; i<this->m_listAdiacenta[nod].size(); i++){ | ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbKilled by Signal 110
215ms331kbKilled by Signal 110
31ms184kbKilled by Signal 110
43ms307kbKilled by Signal 110
511ms413kbKilled by Signal 110
685ms1576kbKilled by Signal 110
7138ms3678kbKilled by Signal 110
8109ms5136kbKilled by Signal 110
9765ms10846kbKilled by Signal 110
10778ms10924kbKilled by Signal 110
Punctaj total0

Ceva nu functioneaza?