Pagini recente » Borderou de evaluare (job #721754) | Borderou de evaluare (job #1169135) | Borderou de evaluare (job #3181729) | Borderou de evaluare (job #997970) | Borderou de evaluare (job #2812083)
Borderou de evaluare (job #2812083)
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:129:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
129 | 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:150:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
150 | for(int i=0; i<connections.size(); i++)
| ~^~~~~~~~~~~~~~~~~~~
main.cpp:163:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
163 | 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:191: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]
191 | 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:196:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
196 | for(int i=0;i<grade.size();i++)
| ~^~~~~~~~~~~~~
main.cpp:207:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
207 | 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:225:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
225 | 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:267:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
267 | 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:299:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
299 | 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:332:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
332 | 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:395:5: warning: value computed is not used [-Wunused-value]
395 | *this;
| ^~~~~
main.cpp:395:5: warning: statement has no effect [-Wunused-value]
main.cpp:396:1: warning: no return statement in function returning non-void [-Wreturn-type]
395 | *this;
+++ |+ return *this;
396 | }
| ^
main.cpp: In member function 'std::vector<std::pair<int, int> > Graf_Neorientat_Cost::begin_APM(int&)':
main.cpp:474: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]
474 | 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 |
1 | 2ms | 188kb | OK | 10 |
2 | 2ms | 184kb | OK | 10 |
3 | 6ms | 200kb | OK | 10 |
4 | 16ms | 311kb | OK | 10 |
5 | 25ms | 319kb | OK | 10 |
6 | 44ms | 348kb | OK | 10 |
7 | 50ms | 393kb | Time limit exceeded | 0 |
8 | 50ms | 417kb | Time limit exceeded | 0 |
9 | 50ms | 442kb | Time limit exceeded | 0 |
10 | 50ms | 466kb | Time limit exceeded | 0 |
Punctaj total | 60 |