Borderou de evaluare (job #1942144)

Utilizator sfechisalin@yahoo.comSfechis Alin [email protected] Data 27 martie 2017 20:25:52
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 30

Raport evaluator

Compilare: user.cpp: In member function ‘int Heap::best_ind(int)’: user.cpp:89:10: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] if (ind << 1 + 1 < Elems.size()) ^ user.cpp:89:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (ind << 1 + 1 < Elems.size()) ^ user.cpp: In member function ‘void Heap::del_elem()’: user.cpp:105:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while (ind << 1 < Elems.size()) ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms452kbCorect10
20ms452kbCorect10
30ms500kbCost incorect0
40ms508kbCost incorect0
50ms532kbCost incorect0
6396ms12760kbCost incorect0
7372msDepăşitMemory limit exceeded.0
8120ms5172kbCost incorect0
9148ms5232kbCorect10
10404msDepăşitMemory limit exceeded.0
Punctaj total30

Ceva nu functioneaza?