Borderou de evaluare (job #3132661)

Utilizator DevCrutCorolevschi Mihai DevCrut Data 23 mai 2023 13:53:59
Problema Arbori binari de cautare echilibrati Status done
Runda arhiva-test Compilator cpp-64 | Vezi sursa
Scor 15

Raport evaluator

Compilare: In member function 'void Node<T>::addValue(int, T) [with T = int]', inlined from 'void Node<T>::merge(int) [with T = int]' at main.cpp:247:15: main.cpp:79:45: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds] 79 | this->values[i] = this->values[i - 1]; | ~~~~~~~~~~~~^ main.cpp: In member function 'void Node<T>::merge(int) [with T = int]': main.cpp:15:11: note: while referencing 'Node<int>::values' 15 | T values[3]; // Array of keys | ^~~~~~ In member function 'void Node<T>::addValue(int, T) [with T = int]', inlined from 'void Node<T>::merge(int) [with T = int]' at main.cpp:224:18: main.cpp:79:45: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds] 79 | this->values[i] = this->values[i - 1]; | ~~~~~~~~~~~~^ main.cpp: In member function 'void Node<T>::merge(int) [with T = int]': main.cpp:15:11: note: while referencing 'Node<int>::values' 15 | T values[3]; // Array of keys | ^~~~~~ In member function 'void Node<T>::addValue(int, T) [with T = int]', inlined from 'void Node<T>::merge(int) [with T = int]' at main.cpp:247:15, inlined from 'void Tree234<T>::_remove(T&, Node<T>*) [with T = int]' at main.cpp:506:28: main.cpp:79:45: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds] 79 | this->values[i] = this->values[i - 1]; | ~~~~~~~~~~~~^ main.cpp: In function 'void Tree234<T>::_remove(T&, Node<T>*) [with T = int]': main.cpp:15:11: note: while referencing 'Node<int>::values' 15 | T values[3]; // Array of keys | ^~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms303kbOK5
20ms303kbOK5
30ms303kbOK5
429ms3207kbIncorect0
529ms3252kbIncorect0
629ms3207kbIncorect0
70ms303kbIncorect0
80ms303kbIncorect0
90ms303kbIncorect0
100ms303kbIncorect0
1124ms2035kbIncorect0
1224ms2043kbIncorect0
1324ms2035kbIncorect0
1424ms2043kbIncorect0
15203ms29749kbTime limit exceeded0
16203ms57593kbTime limit exceeded0
17203ms33914kbTime limit exceeded0
18203ms28921kbTime limit exceeded0
19203ms25296kbTime limit exceeded0
20203ms27828kbTime limit exceeded0
Punctaj total15

Ceva nu functioneaza?