Pagini recente » Borderou de evaluare (job #1122796) | Borderou de evaluare (job #1089400) | Borderou de evaluare (job #1114570) | Borderou de evaluare (job #2219061) | Borderou de evaluare (job #2814183)
Borderou de evaluare (job #2814183)
Raport evaluator
Compilare:
main.cpp: In constructor 'graf::graf(std::vector<std::vector<int> >, int, int)':
main.cpp:12:30: warning: 'graf::adiacenta' will be initialized after [-Wreorder]
12 | vector < vector < int >> adiacenta;
| ^~~~~~~~~
main.cpp:11:9: warning: 'int graf::noduri' [-Wreorder]
11 | int noduri, muchii;
| ^~~~~~
main.cpp:16:5: 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:30: warning: 'graf::adiacenta' will be initialized after [-Wreorder]
12 | vector < vector < int >> adiacenta;
| ^~~~~~~~~
main.cpp:11:9: warning: 'int graf::noduri' [-Wreorder]
11 | int noduri, muchii;
| ^~~~~~
main.cpp:19:5: 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:66:40: warning: 'graf_neorientat_ponderat::adiacentap' will be initialized after [-Wreorder]
66 | vector< vector< pair< int, int >>> adiacentap;
| ^~~~~~~~~~
main.cpp:68:165: warning: base 'graf_neorientat' [-Wreorder]
68 | graf_neorientat_ponderat(vector < vector < pair<int, int> >> listaAdiacenta, int noduri, int muchii): adiacentap(listaAdiacenta), graf_neorientat(noduri, muchii) {};
| ^
main.cpp:68:5: warning: when initialized here [-Wreorder]
68 | 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:66:40: warning: 'graf_neorientat_ponderat::adiacentap' will be initialized after [-Wreorder]
66 | vector< vector< pair< int, int >>> adiacentap;
| ^~~~~~~~~~
main.cpp:69:107: warning: base 'graf_neorientat' [-Wreorder]
69 | graf_neorientat_ponderat(int noduri, int muchii): adiacentap(noduri+1), graf_neorientat(noduri, muchii) {};
| ^
main.cpp:69:5: warning: when initialized here [-Wreorder]
69 | 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:81:40: warning: 'graf_orientat_ponderat::adiacentap' will be initialized after [-Wreorder]
81 | vector< vector< pair< int, int >>> adiacentap;
| ^~~~~~~~~~
main.cpp:84:103: warning: base 'graf_orientat' [-Wreorder]
84 | graf_orientat_ponderat(int noduri, int muchii): adiacentap(noduri+1), graf_orientat(noduri, muchii) {};
| ^
main.cpp:84:5: warning: when initialized here [-Wreorder]
84 | graf_orientat_ponderat(int noduri, int muchii): adiacentap(noduri+1), graf_orientat(noduri, muchii) {};
| ^~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 188kb | OK | 10 |
2 | 2ms | 184kb | OK | 10 |
3 | 2ms | 184kb | OK | 10 |
4 | 2ms | 184kb | OK | 10 |
5 | 20ms | 2531kb | OK | 10 |
6 | 72ms | 8376kb | OK | 10 |
7 | 111ms | 11730kb | OK | 10 |
8 | 182ms | 17948kb | OK | 10 |
9 | 140ms | 20955kb | OK | 10 |
10 | 201ms | 23400kb | Time limit exceeded | 0 |
Punctaj total | 90 |