Borderou de evaluare (job #1704087)

Utilizator andreibotilaBotila Andrei andreibotila Data 18 mai 2016 00:11:15
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In function ‘void Union(int, int, std::vector<Arb*>)’: user.cpp:45:55: warning: suggest parentheses around assignment used as truth value [-Wparentheses] if (arbsVect[aParent]->rank = arbsVect[bParent]->rank) { ^ user.cpp: In function ‘int main()’: user.cpp:55:29: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] fscanf(in, "%d %d", &N, &M); ^ user.cpp:63:37: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] fscanf(in, "%d %d %d", &x, &y, &c); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms440kbCost incorect0
20ms436kbCost incorect0
30ms456kbCost incorect0
40ms468kbCost incorect0
524msDepăşitMemory limit exceeded.0
6Depăşit2648kbTime limit exceeded.0
7Depăşit4628kbTime limit exceeded.0
8336msDepăşitMemory limit exceeded.0
9152msDepăşitMemory limit exceeded.0
10Depăşit3964kbTime limit exceeded.0
Punctaj total0

Ceva nu functioneaza?