Pagini recente » Borderou de evaluare (job #1856132) | Borderou de evaluare (job #1844207) | Borderou de evaluare (job #1604930) | Borderou de evaluare (job #3134771) | Borderou de evaluare (job #2812062)
Borderou de evaluare (job #2812062)
Raport evaluator
Compilare:
main.cpp: In static member function 'static void Graf_Neorientat::dfs_muchie_critica(int, int, int, std::unordered_map<int, std::vector<int> >, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
main.cpp:125:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
125 | for(int i=0; i<lista_adiacenta1[nod].size(); i++)
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static std::vector<std::vector<int> > Graf_Neorientat::muchii_critice(int, std::vector<std::vector<int> >)':
main.cpp:146:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
146 | for(int i=0; i<connections.size(); i++)
| ~^~~~~~~~~~~~~~~~~~~
main.cpp:159:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
159 | for(int i=0; i<connections.size(); i++)//parcurgem vectorul de muchii
| ~^~~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static bool Graf_Neorientat::havel_hakimi(std::vector<int>)':
main.cpp:187:16: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
187 | if(grade[0]>=grade.size())//daca primul grad este mai mare decat numarul de noduri-1 atunci este clar ca nu se poate scrie un graf cu aceste grade
main.cpp:192:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
192 | for(int i=0;i<grade.size();i++)
| ~^~~~~~~~~~~~~
main.cpp:203:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
203 | for(int i=1;i<grade.size();i++)
| ~^~~~~~~~~~~~~
main.cpp: In member function 'void Graf_Neorientat::dfs_biconex_stiva(int, std::vector<int>&, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<std::set<int, std::less<int> > >&, std::stack<std::pair<int, int> >&)':
main.cpp:221:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
221 | for(int i=0;i<lista_adiacenta[nod].size();i++)//parcurgem inca o data arborele dfs
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf_Neorientat::dfs_biconex(int, int, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::unordered_map<int, std::vector<int> >&)':
main.cpp:263:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
263 | for(int i=0;i<lista_adiacenta[nod].size();i++)//parcurgem lista de veicini a nodului
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::vector<std::set<int, std::less<int> > > Graf_Neorientat::begin_biconex()':
main.cpp:295:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
295 | for(int j=0;j<lista_fii[i].size();j++)//parcugem lista de fii
| ~^~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void Graf_Neorientat::dfs(int, std::vector<int>&)':
main.cpp:328:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
328 | for(int i=0;i<lista_adiacenta[nod].size();i++)//parcurgem toti vecinii nodului curent
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'Graf_Neorientat& Graf_Neorientat::operator=(const Graf_Neorientat&)':
main.cpp:391:5: warning: value computed is not used [-Wunused-value]
391 | *this;
| ^~~~~
main.cpp:391:5: warning: statement has no effect [-Wunused-value]
main.cpp:392:1: warning: no return statement in function returning non-void [-Wreturn-type]
391 | *this;
+++ |+ return *this;
392 | }
| ^
main.cpp: In member function 'std::vector<std::pair<int, int> > Graf_Neorientat_Cost::begin_APM(int&)':
main.cpp:470:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
470 | for(int i=0;i<lista_adiacenta[1].size();i++)//initiizam primele valori din heap cu muchiile legate de nodul 1
| ~^~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 19ms | 8282kb | OK | 10 | 10 |
2 | 16ms | 7192kb | OK | 10 | 10 |
3 | 20ms | 8249kb | OK | 10 | 10 |
4 | 20ms | 8249kb | OK | 10 | 10 |
5 | 20ms | 8335kb | OK | 10 | 10 |
6 | 20ms | 8347kb | OK | 10 | 10 |
7 | 25ms | 8409kb | OK | 10 | 10 |
8 | 64ms | 8380kb | Time limit exceeded | 0 | 0 |
9 | 64ms | 8323kb | Time limit exceeded | 0 |
10 | 64ms | 8396kb | Time limit exceeded | 0 |
Punctaj total | 70 |