Borderou de evaluare (job #1426101)

Utilizator BKmarianmarian BKmarian Data 28 aprilie 2015 22:28:44
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 prim2(int)’: user.cpp:29:11: warning: array subscript is above array bounds [-Warray-bounds] A[2][A[0][0]]=T[nod]; ^ user.cpp:42:29: warning: array subscript is above array bounds [-Warray-bounds] g<<A[1][i]<<" "<<A[2][i]<<"\n"; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms488kbCost incorect0
20ms504kbCost incorect0
30ms1084kbCost incorect0
40ms1328kbCost incorect0
50ms1096kbCost incorect0
60ms400kbKilled by signal 11(SIGSEGV).0
70ms404kbKilled by signal 11(SIGSEGV).0
80ms396kbKilled by signal 11(SIGSEGV).0
90ms404kbKilled by signal 11(SIGSEGV).0
100ms400kbKilled by signal 11(SIGSEGV).0
Punctaj total0

Ceva nu functioneaza?