Borderou de evaluare (job #2790796)

Utilizator MihaelaDanilaDanila Mihaela MihaelaDanila Data 29 octombrie 2021 15:46:11
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
16ms335kbKilled by Signal 110
26ms307kbKilled by Signal 110
36ms339kbKilled by Signal 110
48ms344kbKilled by Signal 110
513ms446kbKilled by Signal 110
658ms1609kbKilled by Signal 110
7157ms3657kbKilled by Signal 110
8124ms5197kbKilled by Signal 110
9647ms10919kbKilled by Signal 110
10654ms10919kbKilled by Signal 110
Punctaj total0

Ceva nu functioneaza?