Borderou de evaluare (job #2906406)

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

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:63:16: note: in expansion of macro 'maxi' 63 | 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:72:16: note: in expansion of macro 'mini' 72 | 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
4110ms1269kbOK5
588ms1314kbOK5
690ms1310kbOK5
71ms184kbOK5
81ms184kbOK5
91ms184kbOK5
101ms184kbOK5
11140ms1200kbOK5
12151ms1138kbOK5
1383ms1200kbOK5
14113ms1093kbOK5
151ms184kbOK5
161ms184kbOK5
171ms184kbOK5
18168ms2056kbOK5
19169ms2232kbOK5
20223ms2015kbOK5
Punctaj total100

Ceva nu functioneaza?