Borderou de evaluare (job #1472574)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 17 august 2015 13:02:47
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator c | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.c: In function ‘M’: user.c:25:58: warning: operation on ‘h[l]’ may be undefined [-Wsequence-point] void M(int l,int k) { for(d[h[l]]=k;l>1&&d[h[l/2]]>k;h[l]^=h[l/2]^=h[l]^=h[l/2],w[h[l]]=l,w[h[l/2]]=l/2,l/=2); } ^ user.c: In function ‘main’: user.c:27:9: warning: ignoring return value of ‘freopen’, declared with attribute warn_unused_result [-Wunused-result] freopen("apm.in","r",stdin),freopen("apm.out","w",stdout),scanf("%d%d",&n,&m); ^ user.c:27:37: warning: ignoring return value of ‘freopen’, declared with attribute warn_unused_result [-Wunused-result] freopen("apm.in","r",stdin),freopen("apm.out","w",stdout),scanf("%d%d",&n,&m); ^ user.c:27:65: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] freopen("apm.in","r",stdin),freopen("apm.out","w",stdout),scanf("%d%d",&n,&m); ^ user.c:29:11: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d",&a[i],&b[i],&c[i]),u[a[i]]++,u[b[i]]++; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms296kbCost incorect0
20ms300kbCost incorect0
30ms316kbCost incorect0
40ms316kbCost incorect0
50ms308kbCost incorect0
692ms3216kbCost incorect0
7172ms6372kbCost incorect0
832ms1448kbCost incorect0
940ms1440kbCost incorect0
10148ms5196kbCost incorect0
Punctaj total0

Ceva nu functioneaza?