Borderou de evaluare (job #2803103)

Utilizator Virgil993Virgil Turcu Virgil993 Data 19 noiembrie 2021 14:57:01
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

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:124:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 124 | 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:145:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 145 | for(int i=0; i<connections.size(); i++) | ~^~~~~~~~~~~~~~~~~~~ main.cpp:158:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 158 | 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:186: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] 186 | 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:191:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 191 | for(int i=0;i<grade.size();i++) | ~^~~~~~~~~~~~~ main.cpp:202:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 202 | 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:220:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 220 | 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:262:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 262 | 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:294:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 294 | 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:327:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 327 | 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:390:5: warning: value computed is not used [-Wunused-value] 390 | *this; | ^~~~~ main.cpp:390:5: warning: statement has no effect [-Wunused-value] main.cpp:391:1: warning: no return statement in function returning non-void [-Wreturn-type] 390 | *this; +++ |+ return *this; 391 | } | ^ main.cpp: In member function 'std::vector<std::pair<int, int> > Graf_Neorientat_Cost::begin_APM(int&)': main.cpp:469: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] 469 | 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
11ms184kbOK10
21ms184kbOK10
32ms184kbOK10
41ms184kbOK10
540ms1359kbOK10
658ms2285kbOK10
7104ms3330kbOK10
8255ms6356kbOK10
9229ms6205kbOK10
10433ms9838kbOK10
Punctaj total100

Ceva nu functioneaza?