Borderou de evaluare (job #1711979)

Utilizator andreicoman299Coman Andrei andreicoman299 Data 1 iunie 2016 18:56: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:3:763: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int num[24];int i, max, st, fin;struct Trie{int poz;Trie *fii[2];Trie(){poz=100000;fii[0]=fii[1]=0;}};Trie *T=new Trie;void Trie_insert(Trie *nod, int ind){if(ind<0)nod->poz=i;else{if(nod->fii[num[ind]]==0)nod->fii[num[ind]]=new Trie;Trie_insert(nod->fii[num[ind]], ind-1);}}void Trie_find_max(Trie *nod, int val, int ind){if(ind==-1){if(max<val){max=val;st=nod->poz;fin=i;}}else{if(num[ind]==0){if(nod->fii[1]!=0)Trie_find_max(nod->fii[1], val+(1<<ind), ind-1);else if(nod->fii[0]!=0)Trie_find_max(nod->fii[0], val, ind-1);}else{if(nod->fii[0]!=0)Trie_find_max(nod->fii[0], val+(1<<ind), ind-1);else if(nod->fii[1]!=0)Trie_find_max(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;Trie_insert(T, 22);for(i=1;i<=n;i++){int x;fscanf(fi,"%d", &x);for(int j=0;j<=22;j++){num[j]=(num[j]^(x%2));x/=2;}Trie_find_max(T, 0, 22);Trie_insert(T, 22);}fprintf(fo,"%d %d %d", max, st+1, fin);fclose(fi);fclose(fo);return 0;} ^ user.cpp:3:837: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int num[24];int i, max, st, fin;struct Trie{int poz;Trie *fii[2];Trie(){poz=100000;fii[0]=fii[1]=0;}};Trie *T=new Trie;void Trie_insert(Trie *nod, int ind){if(ind<0)nod->poz=i;else{if(nod->fii[num[ind]]==0)nod->fii[num[ind]]=new Trie;Trie_insert(nod->fii[num[ind]], ind-1);}}void Trie_find_max(Trie *nod, int val, int ind){if(ind==-1){if(max<val){max=val;st=nod->poz;fin=i;}}else{if(num[ind]==0){if(nod->fii[1]!=0)Trie_find_max(nod->fii[1], val+(1<<ind), ind-1);else if(nod->fii[0]!=0)Trie_find_max(nod->fii[0], val, ind-1);}else{if(nod->fii[0]!=0)Trie_find_max(nod->fii[0], val+(1<<ind), ind-1);else if(nod->fii[1]!=0)Trie_find_max(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;Trie_insert(T, 22);for(i=1;i<=n;i++){int x;fscanf(fi,"%d", &x);for(int j=0;j<=22;j++){num[j]=(num[j]^(x%2));x/=2;}Trie_find_max(T, 0, 22);Trie_insert(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
10ms264kbBine, Ionel!55
20ms260kbBine, Ionel!55
30ms316kbOk... pentru moment55
416ms1644kbBine, Ionel!55
5120ms7220kbOk... pentru moment55
6164ms8904kbBine, Ionel!55
7164ms8888kbOk... pentru moment55
8164ms8884kbOk... pentru moment55
952ms292kbBine, Ionel!55
1040ms256kbOk... pentru moment55
110ms260kbBine, Ionel!55
120ms256kbOk... pentru moment55
130ms296kbOk... pentru moment55
1412ms1412kbOk... pentru moment55
1564ms1352kbBine, Ionel!515
1684ms1356kbBine, Ionel!5
17136ms5392kbBine, Ionel!5
18136ms5372kbOk... pentru moment515
1948ms268kbOk... pentru moment5
2040ms264kbOk... pentru moment5
Punctaj total100

Ceva nu functioneaza?