Pagini recente » Borderou de evaluare (job #323477) | Borderou de evaluare (job #2082519) | Borderou de evaluare (job #2591021) | Borderou de evaluare (job #1450200) | Borderou de evaluare (job #2795582)
Borderou de evaluare (job #2795582)
Raport evaluator
Compilare:
main.cpp:74: warning: ignoring '#pragma region HeapPublicMethods' [-Wunknown-pragmas]
74 | #pragma region HeapPublicMethods
|
main.cpp:144: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
144 | #pragma endregion
|
main.cpp:146: warning: ignoring '#pragma region HeapPrivateMethods' [-Wunknown-pragmas]
146 | #pragma region HeapPrivateMethods
|
main.cpp:231: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
231 | #pragma endregion
|
main.cpp: In instantiation of 'void Heap<T>::Delete(int) [with T = std::pair<int, int>]':
main.cpp:99:5: required from 'void Heap<T>::Pop() [with T = std::pair<int, int>]'
main.cpp:264:26: required from here
main.cpp:189:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
189 | if( node < tree.size() ) SwapNodes(node, tree.size()-1);
| ~~~~~^~~~~~~~~~~~~
main.cpp: In instantiation of 'int Heap<T>::LeftChild(int) [with T = std::pair<int, int>]':
main.cpp:152:16: required from 'void Heap<T>::Descend(int) [with T = std::pair<int, int>]'
main.cpp:191:5: required from 'void Heap<T>::Delete(int) [with T = std::pair<int, int>]'
main.cpp:99:5: required from 'void Heap<T>::Pop() [with T = std::pair<int, int>]'
main.cpp:264:26: required from here
main.cpp:215:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
215 | if( left < tree.size()) {
| ~~~~~^~~~~~~~~~~~~
main.cpp: In instantiation of 'int Heap<T>::RightChild(int) [with T = std::pair<int, int>]':
main.cpp:153:17: required from 'void Heap<T>::Descend(int) [with T = std::pair<int, int>]'
main.cpp:191:5: required from 'void Heap<T>::Delete(int) [with T = std::pair<int, int>]'
main.cpp:99:5: required from 'void Heap<T>::Pop() [with T = std::pair<int, int>]'
main.cpp:264:26: required from here
main.cpp:225:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
225 | if( right < tree.size()) {
| ~~~~~~^~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 1ms | 188kb | OK | 10 | 10 |
2 | 1ms | 184kb | OK | 10 | 10 |
3 | 1ms | 184kb | OK | 10 | 10 |
4 | 1ms | 184kb | OK | 10 | 10 |
5 | 1ms | 184kb | OK | 10 | 60 |
6 | 43ms | 999kb | OK | 10 |
7 | 100ms | 1433kb | OK | 10 |
8 | 67ms | 1859kb | OK | 10 |
9 | 94ms | 1728kb | OK | 10 |
10 | 73ms | 1724kb | OK | 10 |
Punctaj total | 100 |