Pagini recente » Borderou de evaluare (job #953432) | Borderou de evaluare (job #2533729) | Borderou de evaluare (job #2011768) | Borderou de evaluare (job #915940) | Borderou de evaluare (job #1711979)
Borderou de evaluare (job #1711979)
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 |
| 1 | 0ms | 264kb | Bine, Ionel! | 5 | 5 |
| 2 | 0ms | 260kb | Bine, Ionel! | 5 | 5 |
| 3 | 0ms | 316kb | Ok... pentru moment | 5 | 5 |
| 4 | 16ms | 1644kb | Bine, Ionel! | 5 | 5 |
| 5 | 120ms | 7220kb | Ok... pentru moment | 5 | 5 |
| 6 | 164ms | 8904kb | Bine, Ionel! | 5 | 5 |
| 7 | 164ms | 8888kb | Ok... pentru moment | 5 | 5 |
| 8 | 164ms | 8884kb | Ok... pentru moment | 5 | 5 |
| 9 | 52ms | 292kb | Bine, Ionel! | 5 | 5 |
| 10 | 40ms | 256kb | Ok... pentru moment | 5 | 5 |
| 11 | 0ms | 260kb | Bine, Ionel! | 5 | 5 |
| 12 | 0ms | 256kb | Ok... pentru moment | 5 | 5 |
| 13 | 0ms | 296kb | Ok... pentru moment | 5 | 5 |
| 14 | 12ms | 1412kb | Ok... pentru moment | 5 | 5 |
| 15 | 64ms | 1352kb | Bine, Ionel! | 5 | 15 |
| 16 | 84ms | 1356kb | Bine, Ionel! | 5 |
| 17 | 136ms | 5392kb | Bine, Ionel! | 5 |
| 18 | 136ms | 5372kb | Ok... pentru moment | 5 | 15 |
| 19 | 48ms | 268kb | Ok... pentru moment | 5 |
| 20 | 40ms | 264kb | Ok... pentru moment | 5 |
| Punctaj total | 100 |