Pagini recente » Borderou de evaluare (job #1612031) | Borderou de evaluare (job #1528439) | Borderou de evaluare (job #876174) | Borderou de evaluare (job #2474223) | Borderou de evaluare (job #3142364)
Borderou de evaluare (job #3142364)
Raport evaluator
Compilare:
main.cpp: In constructor 'BinaryIndexTree::BinaryIndexTree(size_t)':
main.cpp:10:44: warning: narrowing conversion of 'N' from 'size_t' {aka 'long unsigned int'} to 'BinaryIndexTree::t' {aka 'int'} [-Wnarrowing]
10 | explicit BinaryIndexTree(size_t N): N_{N}, tree_(N, 0) {}
| ^
main.cpp: In member function 'int BinaryIndexTree::findPosFor(t) const':
main.cpp:31:35: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'const BinaryIndexTree::t' {aka 'const int'} [-Wsign-compare]
31 | for (bitMask = 1; bitMask <= N_; bitMask <<= 1);
| ~~~~~~~~^~~~~
main.cpp:33:34: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'const BinaryIndexTree::t' {aka 'const int'} [-Wsign-compare]
33 | if ( (idx + bitMask) <= N_ && tree_[idx + bitMask - 1] < ssum) {
| ~~~~~~~~~~~~~~~~^~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 303kb | OK | 10 |
2 | 0ms | 303kb | OK | 10 |
3 | 1ms | 303kb | OK | 10 |
4 | 5ms | 557kb | OK | 10 |
5 | 9ms | 557kb | OK | 10 |
6 | 14ms | 815kb | OK | 10 |
7 | 19ms | 978kb | OK | 10 |
8 | 24ms | 1089kb | OK | 10 |
9 | 24ms | 1114kb | OK | 10 |
10 | 24ms | 1085kb | OK | 10 |
Punctaj total | 100 |