Borderou de evaluare (job #1749887)

Utilizator sfechisalin@yahoo.comSfechis Alin [email protected] Data 29 august 2016 01:59:15
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 30

Raport evaluator

Compilare: user.cpp: In function ‘int ind_min(int)’: user.cpp:21:11: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] if(nod<<1 +1 <=heap[0]) ^ user.cpp:22:44: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] return ((d[heap[nod<<1]]<d[heap[nod<<1 +1]])?(nod<<1):(2*nod+1)); ^ user.cpp: In function ‘int main()’: user.cpp:83:37: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] freopen("dijkstra.in","r",stdin); ^ user.cpp:84:39: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] freopen("dijkstra.out","w",stdout); ^ user.cpp:85:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d\n",&n,&m); ^ user.cpp:88:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d\n",&x,&y,&z); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms444kbOK10
20ms440kbOK10
30ms476kbIncorect0
40ms492kbIncorect0
520ms908kbIncorect0
636ms1292kbIncorect0
748ms1608kbIncorect0
860ms2072kbOK10
9172ms4016kbIncorect0
10228ms5028kbIncorect0
Punctaj total30

Ceva nu functioneaza?