Borderou de evaluare (job #1711985)

Utilizator andreicoman299Coman Andrei andreicoman299 Data 1 iunie 2016 19:02:35
Problema Xor Max Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:2:611: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int q[24];int i, max, st, fin;struct A{int c;A *fii[2];A(){c=100000;fii[0]=fii[1]=0;}};A *T=new A;void y(A *b, int ind){if(ind<0)b->c=i;else{if(b->fii[q[ind]]==0)b->fii[q[ind]]=new A;y(b->fii[q[ind]], ind-1);}}void z(A *b, int val, int ind){if(ind==-1){if(max<val){max=val;st=b->c;fin=i;}}else{if(q[ind]==0){if(b->fii[1]!=0)z(b->fii[1], val+(1<<ind), ind-1);else if(b->fii[0]!=0)z(b->fii[0], val, ind-1);}else{if(b->fii[0]!=0)z(b->fii[0], val+(1<<ind), ind-1);else if(b->fii[1]!=0)z(b->fii[1], val, ind-1);}}}int main(){int n;FILE*fi,*fo;fi=fopen("xormax.in","r");fo=fopen("xormax.out","w");fscanf(fi,"%d", &n);max=-1;i=0;y(T, 22);for(i=1;i<=n;i++){int x;fscanf(fi,"%d", &x);for(int j=0;j<=22;j++){q[j]=(q[j]^(x%2));x/=2;}z(T, 0, 22);y(T, 22);}fprintf(fo,"%d %d %d", max, st+1, fin);fclose(fi);fclose(fo);return 0;} ^ user.cpp:2:675: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int q[24];int i, max, st, fin;struct A{int c;A *fii[2];A(){c=100000;fii[0]=fii[1]=0;}};A *T=new A;void y(A *b, int ind){if(ind<0)b->c=i;else{if(b->fii[q[ind]]==0)b->fii[q[ind]]=new A;y(b->fii[q[ind]], ind-1);}}void z(A *b, int val, int ind){if(ind==-1){if(max<val){max=val;st=b->c;fin=i;}}else{if(q[ind]==0){if(b->fii[1]!=0)z(b->fii[1], val+(1<<ind), ind-1);else if(b->fii[0]!=0)z(b->fii[0], val, ind-1);}else{if(b->fii[0]!=0)z(b->fii[0], val+(1<<ind), ind-1);else if(b->fii[1]!=0)z(b->fii[1], val, ind-1);}}}int main(){int n;FILE*fi,*fo;fi=fopen("xormax.in","r");fo=fopen("xormax.out","w");fscanf(fi,"%d", &n);max=-1;i=0;y(T, 22);for(i=1;i<=n;i++){int x;fscanf(fi,"%d", &x);for(int j=0;j<=22;j++){q[j]=(q[j]^(x%2));x/=2;}z(T, 0, 22);y(T, 22);}fprintf(fo,"%d %d %d", max, st+1, fin);fclose(fi);fclose(fo);return 0;} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms260kbOk... pentru moment55
20ms260kbBine, Ionel!55
30ms320kbBine, Ionel!55
412ms1644kbOk... pentru moment55
5120ms7220kbBine, Ionel!55
6164ms8900kbOk... pentru moment55
7164ms8896kbBine, Ionel!55
8160ms8884kbOk... pentru moment55
952ms296kbOk... pentru moment55
1040ms260kbOk... pentru moment55
110ms260kbBine, Ionel!55
120ms264kbOk... pentru moment55
130ms296kbOk... pentru moment55
1412ms1412kbOk... pentru moment55
1568ms1356kbBine, Ionel!515
1684ms1356kbBine, Ionel!5
17136ms5384kbBine, Ionel!5
18136ms5376kbOk... pentru moment515
1948ms264kbOk... pentru moment5
2040ms256kbOk... pentru moment5
Punctaj total100

Ceva nu functioneaza?