Borderou de evaluare (job #1711981)

Utilizator andreicoman299Coman Andrei andreicoman299 Data 1 iunie 2016 18:58:22
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:3:649: 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 poz;A *fii[2];A(){poz=100000;fii[0]=fii[1]=0;}};A *T=new A;void y(A *nod, int ind){if(ind<0)nod->poz=i;else{if(nod->fii[q[ind]]==0)nod->fii[q[ind]]=new A;y(nod->fii[q[ind]], ind-1);}}void z(A *nod, int val, int ind){if(ind==-1){if(max<val){max=val;st=nod->poz;fin=i;}}else{if(q[ind]==0){if(nod->fii[1]!=0)z(nod->fii[1], val+(1<<ind), ind-1);else if(nod->fii[0]!=0)z(nod->fii[0], val, ind-1);}else{if(nod->fii[0]!=0)z(nod->fii[0], val+(1<<ind), ind-1);else if(nod->fii[1]!=0)z(nod->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:3:713: 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 poz;A *fii[2];A(){poz=100000;fii[0]=fii[1]=0;}};A *T=new A;void y(A *nod, int ind){if(ind<0)nod->poz=i;else{if(nod->fii[q[ind]]==0)nod->fii[q[ind]]=new A;y(nod->fii[q[ind]], ind-1);}}void z(A *nod, int val, int ind){if(ind==-1){if(max<val){max=val;st=nod->poz;fin=i;}}else{if(q[ind]==0){if(nod->fii[1]!=0)z(nod->fii[1], val+(1<<ind), ind-1);else if(nod->fii[0]!=0)z(nod->fii[0], val, ind-1);}else{if(nod->fii[0]!=0)z(nod->fii[0], val+(1<<ind), ind-1);else if(nod->fii[1]!=0)z(nod->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
20ms256kbBine, Ionel!55
30ms320kbOk... pentru moment55
412ms1648kbOk... pentru moment55
5116ms7216kbBine, Ionel!55
6168ms8900kbOk... pentru moment55
7164ms8888kbBine, Ionel!55
8160ms8888kbBine, Ionel!55
948ms292kbBine, Ionel!55
1036ms264kbOk... pentru moment55
110ms260kbBine, Ionel!55
120ms260kbBine, Ionel!55
130ms292kbBine, Ionel!55
1412ms1404kbOk... pentru moment55
1564ms1352kbBine, Ionel!515
1684ms1356kbOk... pentru moment5
17136ms5388kbBine, Ionel!5
18136ms5372kbBine, Ionel!515
1948ms272kbOk... pentru moment5
2040ms264kbBine, Ionel!5
Punctaj total100

Ceva nu functioneaza?