Pagini recente » Borderou de evaluare (job #1521816) | Borderou de evaluare (job #1778848) | Borderou de evaluare (job #2847532) | Borderou de evaluare (job #1886399) | Borderou de evaluare (job #1711981)
Borderou de evaluare (job #1711981)
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 |
1 | 0ms | 260kb | Ok... pentru moment | 5 | 5 |
2 | 0ms | 256kb | Bine, Ionel! | 5 | 5 |
3 | 0ms | 320kb | Ok... pentru moment | 5 | 5 |
4 | 12ms | 1648kb | Ok... pentru moment | 5 | 5 |
5 | 116ms | 7216kb | Bine, Ionel! | 5 | 5 |
6 | 168ms | 8900kb | Ok... pentru moment | 5 | 5 |
7 | 164ms | 8888kb | Bine, Ionel! | 5 | 5 |
8 | 160ms | 8888kb | Bine, Ionel! | 5 | 5 |
9 | 48ms | 292kb | Bine, Ionel! | 5 | 5 |
10 | 36ms | 264kb | Ok... pentru moment | 5 | 5 |
11 | 0ms | 260kb | Bine, Ionel! | 5 | 5 |
12 | 0ms | 260kb | Bine, Ionel! | 5 | 5 |
13 | 0ms | 292kb | Bine, Ionel! | 5 | 5 |
14 | 12ms | 1404kb | Ok... pentru moment | 5 | 5 |
15 | 64ms | 1352kb | Bine, Ionel! | 5 | 15 |
16 | 84ms | 1356kb | Ok... pentru moment | 5 |
17 | 136ms | 5388kb | Bine, Ionel! | 5 |
18 | 136ms | 5372kb | Bine, Ionel! | 5 | 15 |
19 | 48ms | 272kb | Ok... pentru moment | 5 |
20 | 40ms | 264kb | Bine, Ionel! | 5 |
Punctaj total | 100 |