Pagini recente » Cod sursa (job #2696194) | Borderou de evaluare (job #1082149) | Borderou de evaluare (job #800342) | Borderou de evaluare (job #505535) | Borderou de evaluare (job #2813358)
Borderou de evaluare (job #2813358)
Raport evaluator
Compilare:
main.cpp: In constructor 'Graph::Graph(int)':
main.cpp:37:9: warning: 'Graph::index' will be initialized after [-Wreorder]
37 | int index;
| ^~~~~
main.cpp:33:40: warning: 'std::vector<int> Graph::degrees' [-Wreorder]
33 | vector<int> lowest, level, father, degrees;
| ^~~~~~~
main.cpp:48:5: warning: when initialized here [-Wreorder]
48 | Graph(int nr_noduri):n(nr_noduri), la(nr_noduri+1), componente_biconexe(0), componente_tconexe(0), lowest(0), level(0), father(0), onstack(0), index(0), degrees(0){}
| ^~~~~
main.cpp: In member function 'void Graph::print_comp_biconexe_udg(std::ostream&)':
main.cpp:230:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
230 | for(int i=1;i<componenta.size();++i)
| ~^~~~~~~~~~~~~~~~~~
main.cpp: In static member function 'static void Graph::print_APM_Kruskal(std::ostream&, std::vector<Weigthed_Edge>&, int)':
main.cpp:482:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Weigthed_Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
482 | while(i<edges.size() && nr_chosen<nn-1)
| ~^~~~~~~~~~~~~
main.cpp: In member function 'int Graph::TD()':
main.cpp:618:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
618 | for(int i=1;i<viz.size();++i)
| ~^~~~~~~~~~~
main.cpp: In static member function 'static std::vector<int> Graph::find_eulerian_cycle(int, std::vector<std::pair<int, int> >)':
main.cpp:800:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
800 | for(auto i=0; i<edges.size(); ++i)
| ~^~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 184kb | Corect | 10 | 30 |
2 | 2ms | 184kb | Corect | 10 |
3 | 2ms | 184kb | Corect | 10 |
4 | 2ms | 184kb | Corect | 10 | 30 |
5 | 6ms | 327kb | Corect | 10 |
6 | 16ms | 1019kb | Corect | 10 |
7 | 25ms | 1781kb | Corect | 10 | 30 |
8 | 82ms | 4456kb | Corect | 10 |
9 | 164ms | 9822kb | Corect | 10 |
10 | 211ms | 14381kb | Corect | 10 | 10 |
Punctaj total | 100 |