Pagini recente » Borderou de evaluare (job #1772883) | Borderou de evaluare (job #1834163) | Borderou de evaluare (job #821736) | Borderou de evaluare (job #636788) | Borderou de evaluare (job #3125108)
Borderou de evaluare (job #3125108)
Raport evaluator
Compilare:
main.cpp: In constructor 'node::node(bool, node*)':
main.cpp:12:10: warning: 'node::leaf' will be initialized after [-Wreorder]
12 | bool leaf;
| ^~~~
main.cpp:11:11: warning: 'node* node::father' [-Wreorder]
11 | node* father;
| ^~~~~~
main.cpp:15:5: warning: when initialized here [-Wreorder]
15 | node(bool leaf,node* father=nullptr):leaf(leaf),father(father){}
| ^~~~
main.cpp: In copy constructor 'node::node(const node&)':
main.cpp:12:10: warning: 'node::leaf' will be initialized after [-Wreorder]
12 | bool leaf;
| ^~~~
main.cpp:11:11: warning: 'node* node::father' [-Wreorder]
11 | node* father;
| ^~~~~~
main.cpp:16:5: warning: when initialized here [-Wreorder]
16 | node(const node &o):separators(o.separators),leaf(o.leaf),father(o.father){
| ^~~~
main.cpp: In member function 'void node::print(int)':
main.cpp:32:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | for(int i=0;i<separators.size();i++){
| ~^~~~~~~~~~~~~~~~~~
main.cpp: In member function 'void node::printinterval(int, int)':
main.cpp:43:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
43 | while (i<separators.size()&&separators[i]<x)
| ~^~~~~~~~~~~~~~~~~~
main.cpp:47:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
47 | while(i<separators.size()&&separators[i]<=y){
| ~^~~~~~~~~~~~~~~~~~
main.cpp:52:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | if(i!=separators.size()){
| ~^~~~~~~~~~~~~~~~~~~
main.cpp:61:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
61 | while (i<separators.size()&&separators[i]<x)
| ~^~~~~~~~~~~~~~~~~~
main.cpp:65:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | while(i<separators.size()&&separators[i]<=y){
| ~^~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:575:22: warning: unused variable 'z' [-Wunused-variable]
575 | int operatie,x,y,z;
| ^
main.cpp: In instantiation of 'void btree<n>::lipseste1(node*) [with long unsigned int n = 500]':
main.cpp:445:25: required from 'void btree<n>::sterge(int) [with long unsigned int n = 500]'
main.cpp:590:25: required from here
main.cpp:270:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
270 | for(int i=0;i<y->children.size();++i){// trebuie sa il gasesc in tata
| ~^~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 303kb | OK | 5 |
2 | 0ms | 303kb | OK | 5 |
3 | 0ms | 303kb | OK | 5 |
4 | 104ms | 765kb | OK | 5 |
5 | 39ms | 659kb | OK | 5 |
6 | 89ms | 688kb | OK | 5 |
7 | 0ms | 303kb | OK | 5 |
8 | 0ms | 303kb | Incorect | 0 |
9 | 0ms | 303kb | OK | 5 |
10 | 0ms | 303kb | Incorect | 0 |
11 | 49ms | 856kb | Incorect | 0 |
12 | 29ms | 802kb | Incorect | 0 |
13 | 34ms | 827kb | Incorect | 0 |
14 | 64ms | 843kb | Incorect | 0 |
15 | 0ms | 303kb | OK | 5 |
16 | 0ms | 303kb | Incorect | 0 |
17 | 0ms | 303kb | OK | 5 |
18 | 49ms | 1564kb | Incorect | 0 |
19 | 54ms | 1765kb | Incorect | 0 |
20 | 64ms | 1650kb | Incorect | 0 |
Punctaj total | 50 |