Borderou de evaluare (job #3132412)

Utilizator DevCrutCorolevschi Mihai DevCrut Data 22 mai 2023 18:41:08
Problema Arbori binari de cautare echilibrati Status done
Runda arhiva-test Compilator cpp-64 | Vezi sursa
Scor 5

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:246: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:223: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:246:15, inlined from 'void Tree234<T>::_remove(T&, Node<T>*) [with T = int]' at main.cpp:513: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
20ms303kbIncorect0
30ms303kbIncorect0
429ms2805kbIncorect0
529ms2576kbIncorect0
629ms2789kbIncorect0
70ms303kbIncorect0
80ms303kbIncorect0
90ms303kbIncorect0
100ms303kbIncorect0
1124ms1810kbIncorect0
1224ms1519kbIncorect0
1324ms1957kbIncorect0
1423ms1495kbIncorect0
15203ms30040kbTime limit exceeded0
16202ms28344kbTime limit exceeded0
17202ms34787kbTime limit exceeded0
18202ms28946kbTime limit exceeded0
19203ms21655kbTime limit exceeded0
20203ms28835kbTime limit exceeded0
Punctaj total5

Ceva nu functioneaza?