Borderou de evaluare (job #2906352)

Utilizator AntoniaPopoviciAntonia-Adelina Popovici AntoniaPopovici Data 25 mai 2022 19:05:11
Problema Arbori binari de cautare echilibrati Status done
Runda arhiva-test Compilator cpp-64 | Vezi sursa
Scor 30

Raport evaluator

Compilare: main.cpp: In function 'int Succesor(Treap*, int)': main.cpp:6:14: warning: overflow in conversion from 'long int' to 'int' changes value from '100000000000' to '1215752192' [-Woverflow] 6 | #define maxi 100000000000 | ^~~~~~~~~~~~ main.cpp:62:16: note: in expansion of macro 'maxi' 62 | return maxi; | ^~~~ main.cpp: In function 'int Predecesor(Treap*, int)': main.cpp:5:15: warning: overflow in conversion from 'long int' to 'int' changes value from '-100000000000' to '-1215752192' [-Woverflow] 5 | #define mini -100000000000 | ^~~~~~~~~~~~ main.cpp:71:16: note: in expansion of macro 'mini' 71 | return mini; | ^~~~ main.cpp: In function 'int Search(Treap*, int)': main.cpp:88:1: warning: control reaches end of non-void function [-Wreturn-type] 88 | } | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms184kbOK5
21ms184kbOK5
31ms184kbOK5
4135ms1318kbOK5
5156ms1253kbOK5
6115ms1314kbOK5
71ms184kbIncorect0
81ms184kbIncorect0
91ms184kbIncorect0
101ms184kbIncorect0
1186ms1208kbIncorect0
12109ms1171kbIncorect0
13102ms1142kbIncorect0
1485ms1171kbIncorect0
151ms184kbIncorect0
161ms184kbIncorect0
171ms184kbIncorect0
18129ms2088kbIncorect0
19140ms2281kbIncorect0
20213ms2052kbIncorect0
Punctaj total30

Ceva nu functioneaza?