Borderou de evaluare (job #1711984)

Utilizator andreicoman299Coman Andrei andreicoman299 Data 1 iunie 2016 19:01:26
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: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:2: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
20ms260kbOk... pentru moment55
30ms316kbOk... pentru moment55
416ms1640kbBine, Ionel!55
5116ms7216kbBine, Ionel!55
6160ms8900kbBine, Ionel!55
7164ms8896kbBine, Ionel!55
8160ms8884kbBine, Ionel!55
952ms296kbOk... pentru moment55
1040ms264kbOk... pentru moment55
110ms260kbOk... pentru moment55
120ms264kbOk... pentru moment55
130ms296kbOk... pentru moment55
1412ms1404kbBine, Ionel!55
1564ms1352kbOk... pentru moment515
1684ms1360kbOk... pentru moment5
17136ms5392kbOk... pentru moment5
18140ms5380kbBine, Ionel!515
1948ms268kbOk... pentru moment5
2040ms260kbOk... pentru moment5
Punctaj total100

Ceva nu functioneaza?