Borderou de evaluare (job #2817694)

Utilizator redikusTiganus Alexandru redikus Data 14 decembrie 2021 00:56:42
Problema Ciclu hamiltonian de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 20

Raport evaluator

Compilare: main.cpp: In constructor 'graf::graf(std::vector<std::vector<int> >, int, int)': main.cpp:12:27: warning: 'graf::adiacenta' will be initialized after [-Wreorder] 12 | vector < vector < int >> adiacenta; | ^~~~~~~~~ main.cpp:11:6: warning: 'int graf::noduri' [-Wreorder] 11 | int noduri, muchii; | ^~~~~~ main.cpp:16:2: warning: when initialized here [-Wreorder] 16 | graf(vector < vector < int >> listaAdiacenta, int noduri, int muchii) : adiacenta(listaAdiacenta), noduri(noduri), muchii(muchii) {}; | ^~~~ main.cpp: In constructor 'graf::graf(int, int)': main.cpp:12:27: warning: 'graf::adiacenta' will be initialized after [-Wreorder] 12 | vector < vector < int >> adiacenta; | ^~~~~~~~~ main.cpp:11:6: warning: 'int graf::noduri' [-Wreorder] 11 | int noduri, muchii; | ^~~~~~ main.cpp:19:2: warning: when initialized here [-Wreorder] 19 | graf(int noduri, int muchii) : adiacenta(noduri + 1), noduri(noduri), muchii(muchii) {}; | ^~~~ main.cpp: In constructor 'graf_neorientat_ponderat::graf_neorientat_ponderat(std::vector<std::vector<std::pair<int, int> > >, int, int)': main.cpp:64:37: warning: 'graf_neorientat_ponderat::adiacentap' will be initialized after [-Wreorder] 64 | vector< vector< pair< int, int >>> adiacentap; | ^~~~~~~~~~ main.cpp:66:163: warning: base 'graf_neorientat' [-Wreorder] 66 | graf_neorientat_ponderat(vector < vector < pair<int, int> >> listaAdiacenta, int noduri, int muchii) : adiacentap(listaAdiacenta), graf_neorientat(noduri, muchii) {}; | ^ main.cpp:66:2: warning: when initialized here [-Wreorder] 66 | graf_neorientat_ponderat(vector < vector < pair<int, int> >> listaAdiacenta, int noduri, int muchii) : adiacentap(listaAdiacenta), graf_neorientat(noduri, muchii) {}; | ^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In constructor 'graf_neorientat_ponderat::graf_neorientat_ponderat(int, int)': main.cpp:64:37: warning: 'graf_neorientat_ponderat::adiacentap' will be initialized after [-Wreorder] 64 | vector< vector< pair< int, int >>> adiacentap; | ^~~~~~~~~~ main.cpp:67:107: warning: base 'graf_neorientat' [-Wreorder] 67 | graf_neorientat_ponderat(int noduri, int muchii) : adiacentap(noduri + 1), graf_neorientat(noduri, muchii) {}; | ^ main.cpp:67:2: warning: when initialized here [-Wreorder] 67 | graf_neorientat_ponderat(int noduri, int muchii) : adiacentap(noduri + 1), graf_neorientat(noduri, muchii) {}; | ^~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In constructor 'graf_orientat_ponderat::graf_orientat_ponderat(int, int)': main.cpp:78:37: warning: 'graf_orientat_ponderat::adiacentap' will be initialized after [-Wreorder] 78 | vector< vector< pair< int, int >>> adiacentap; | ^~~~~~~~~~ main.cpp:81:103: warning: base 'graf_orientat' [-Wreorder] 81 | graf_orientat_ponderat(int noduri, int muchii) : adiacentap(noduri + 1), graf_orientat(noduri, muchii) {}; | ^ main.cpp:81:2: warning: when initialized here [-Wreorder] 81 | graf_orientat_ponderat(int noduri, int muchii) : adiacentap(noduri + 1), graf_orientat(noduri, muchii) {}; | ^~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
1110ms36278kbIncorect0
2111ms36245kbOK5
3111ms36253kbOK5
4111ms36237kbIncorect0
5112ms36315kbIncorect0
6112ms36253kbIncorect0
7144ms36290kbOK5
8142ms36298kbOK5
9129ms36216kbIncorect0
10130ms36319kbIncorect0
11130ms36290kbIncorect0
12126ms36220kbIncorect0
13130ms36302kbIncorect0
14126ms36286kbIncorect0
15482ms36225kbIncorect0
16421ms36212kbIncorect0
17327ms36327kbIncorect0
18627ms36257kbIncorect0
19476ms36237kbIncorect0
20595ms36306kbIncorect0
Punctaj total20

Ceva nu functioneaza?