Pagini recente » Borderou de evaluare (job #928134) | Borderou de evaluare (job #1789088) | Borderou de evaluare (job #645427) | Borderou de evaluare (job #1730173) | Borderou de evaluare (job #1509061)
Borderou de evaluare (job #1509061)
Raport evaluator
Compilare:
user.cpp: In function ‘void A(N*)’:
user.cpp:3:219: warning: array subscript has type ‘char’ [-Wchar-subscripts]
struct N{int a;N *l[26],*x;N(){memset(this,0,sizeof(N)),memset(l,0,26);}};int i,n,j,p,u;char e[1000001],a[10001],*k;N *c[100000001],*s,*r=new N(),*cn,*b[100],*t;void A(N *r){if(!(*k)){b[j]=r;return;}*k-='a';if(!r->l[*k])r->l[*k]=new N();A(r->l[*k++]);}int main(){freopen("ahocorasick.in","r",stdin),freopen("ahocorasick.out","w",stdout);gets(e),scanf("%d\n",&n);for(j=0;j<n;j++)gets(a),k=a,A(r);r->x=c[u++]=r;while(p<u){t=c[p++];for(i=0;i<26;i++)if(t->l[i]){s=t->x;while(s!=r&&!s->l[i])s=s->x;if(s->l[i]&&s->l[i]!=t->l[i])t->l[i]->x=s->l[i];else t->l[i]->x=r;c[u++]=t->l[i];}}for(cn=r,i=0;e[i];i++){while(!cn->l[e[i]-'a']&&cn!=r)cn=cn->x;if(cn->l[e[i]-'a'])cn=cn->l[e[i]-'a'];cn->a++;}for(i=u-1;i>=0;i--)c[i]->x->a+=c[i]->a;for(i=0;i<n;i++)printf("%d\n",b[i]->a);return 0;}
^
user.cpp:3:228: warning: array subscript has type ‘char’ [-Wchar-subscripts]
struct N{int a;N *l[26],*x;N(){memset(this,0,sizeof(N)),memset(l,0,26);}};int i,n,j,p,u;char e[1000001],a[10001],*k;N *c[100000001],*s,*r=new N(),*cn,*b[100],*t;void A(N *r){if(!(*k)){b[j]=r;return;}*k-='a';if(!r->l[*k])r->l[*k]=new N();A(r->l[*k++]);}int main(){freopen("ahocorasick.in","r",stdin),freopen("ahocorasick.out","w",stdout);gets(e),scanf("%d\n",&n);for(j=0;j<n;j++)gets(a),k=a,A(r);r->x=c[u++]=r;while(p<u){t=c[p++];for(i=0;i<26;i++)if(t->l[i]){s=t->x;while(s!=r&&!s->l[i])s=s->x;if(s->l[i]&&s->l[i]!=t->l[i])t->l[i]->x=s->l[i];else t->l[i]->x=r;c[u++]=t->l[i];}}for(cn=r,i=0;e[i];i++){while(!cn->l[e[i]-'a']&&cn!=r)cn=cn->x;if(cn->l[e[i]-'a'])cn=cn->l[e[i]-'a'];cn->a++;}for(i=u-1;i>=0;i--)c[i]->x->a+=c[i]->a;for(i=0;i<n;i++)printf("%d\n",b[i]->a);return 0;}
^
user.cpp:3:249: warning: array subscript has type ‘char’ [-Wchar-subscripts]
struct N{int a;N *l[26],*x;N(){memset(this,0,sizeof(N)),memset(l,0,26);}};int i,n,j,p,u;char e[1000001],a[10001],*k;N *c[100000001],*s,*r=new N(),*cn,*b[100],*t;void A(N *r){if(!(*k)){b[j]=r;return;}*k-='a';if(!r->l[*k])r->l[*k]=new N();A(r->l[*k++]);}int main(){freopen("ahocorasick.in","r",stdin),freopen("ahocorasick.out","w",stdout);gets(e),scanf("%d\n",&n);for(j=0;j<n;j++)gets(a),k=a,A(r);r->x=c[u++]=r;while(p<u){t=c[p++];for(i=0;i<26;i++)if(t->l[i]){s=t->x;while(s!=r&&!s->l[i])s=s->x;if(s->l[i]&&s->l[i]!=t->l[i])t->l[i]->x=s->l[i];else t->l[i]->x=r;c[u++]=t->l[i];}}for(cn=r,i=0;e[i];i++){while(!cn->l[e[i]-'a']&&cn!=r)cn=cn->x;if(cn->l[e[i]-'a'])cn=cn->l[e[i]-'a'];cn->a++;}for(i=u-1;i>=0;i--)c[i]->x->a+=c[i]->a;for(i=0;i<n;i++)printf("%d\n",b[i]->a);return 0;}
^
user.cpp: In function ‘int main()’:
user.cpp:3:337: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
struct N{int a;N *l[26],*x;N(){memset(this,0,sizeof(N)),memset(l,0,26);}};int i,n,j,p,u;char e[1000001],a[10001],*k;N *c[100000001],*s,*r=new N(),*cn,*b[100],*t;void A(N *r){if(!(*k)){b[j]=r;return;}*k-='a';if(!r->l[*k])r->l[*k]=new N();A(r->l[*k++]);}int main(){freopen("ahocorasick.in","r",stdin),freopen("ahocorasick.out","w",stdout);gets(e),scanf("%d\n",&n);for(j=0;j<n;j++)gets(a),k=a,A(r);r->x=c[u++]=r;while(p<u){t=c[p++];for(i=0;i<26;i++)if(t->l[i]){s=t->x;while(s!=r&&!s->l[i])s=s->x;if(s->l[i]&&s->l[i]!=t->l[i])t->l[i]->x=s->l[i];else t->l[i]->x=r;c[u++]=t->l[i];}}for(cn=r,i=0;e[i];i++){while(!cn->l[e[i]-'a']&&cn!=r)cn=cn->x;if(cn->l[e[i]-'a'])cn=cn->l[e[i]-'a'];cn->a++;}for(i=u-1;i>=0;i--)c[i]->x->a+=c[i]->a;for(i=0;i<n;i++)printf("%d\n",b[i]->a);return 0;}
^
user.cpp:3:337: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
user.cpp:3:362: warning: ignoring return value of ‘char* gets(char*)’, declared with attribute warn_unused_result [-Wunused-result]
struct N{int a;N *l[26],*x;N(){memset(this,0,sizeof(N)),memset(l,0,26);}};int i,n,j,p,u;char e[1000001],a[10001],*k;N *c[100000001],*s,*r=new N(),*cn,*b[100],*t;void A(N *r){if(!(*k)){b[j]=r;return;}*k-='a';if(!r->l[*k])r->l[*k]=new N();A(r->l[*k++]);}int main(){freopen("ahocorasick.in","r",stdin),freopen("ahocorasick.out","w",stdout);gets(e),scanf("%d\n",&n);for(j=0;j<n;j++)gets(a),k=a,A(r);r->x=c[u++]=r;while(p<u){t=c[p++];for(i=0;i<26;i++)if(t->l[i]){s=t->x;while(s!=r&&!s->l[i])s=s->x;if(s->l[i]&&s->l[i]!=t->l[i])t->l[i]->x=s->l[i];else t->l[i]->x=r;c[u++]=t->l[i];}}for(cn=r,i=0;e[i];i++){while(!cn->l[e[i]-'a']&&cn!=r)cn=cn->x;if(cn->l[e[i]-'a'])cn=cn->l[e[i]-'a'];cn->a++;}for(i=u-1;i>=0;i--)c[i]->x->a+=c[i]->a;for(i=0;i<n;i++)printf("%d\n",b[i]->a);return 0;}
^
user.cpp:3:362: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
user.cpp:3:395: warning: ignoring return value of ‘char* gets(char*)’, declared with attribute warn_unused_result [-Wunused-result]
struct N{int a;N *l[26],*x;N(){memset(this,0,sizeof(N)),memset(l,0,26);}};int i,n,j,p,u;char e[1000001],a[10001],*k;N *c[100000001],*s,*r=new N(),*cn,*b[100],*t;void A(N *r){if(!(*k)){b[j]=r;return;}*k-='a';if(!r->l[*k])r->l[*k]=new N();A(r->l[*k++]);}int main(){freopen("ahocorasick.in","r",stdin),freopen("ahocorasick.out","w",stdout);gets(e),scanf("%d\n",&n);for(j=0;j<n;j++)gets(a),k=a,A(r);r->x=c[u++]=r;while(p<u){t=c[p++];for(i=0;i<26;i++)if(t->l[i]){s=t->x;while(s!=r&&!s->l[i])s=s->x;if(s->l[i]&&s->l[i]!=t->l[i])t->l[i]->x=s->l[i];else t->l[i]->x=r;c[u++]=t->l[i];}}for(cn=r,i=0;e[i];i++){while(!cn->l[e[i]-'a']&&cn!=r)cn=cn->x;if(cn->l[e[i]-'a'])cn=cn->l[e[i]-'a'];cn->a++;}for(i=u-1;i>=0;i--)c[i]->x->a+=c[i]->a;for(i=0;i<n;i++)printf("%d\n",b[i]->a);return 0;}
^
/tmp/ccTpNbwN.o: In function `main':
user.cpp:(.text.startup+0x56): warning: the `gets' function is dangerous and should not be used.
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 280kb | OK | 5 |
2 | 0ms | 280kb | OK | 5 |
3 | 0ms | 280kb | OK | 5 |
4 | 0ms | 280kb | OK | 5 |
5 | 0ms | 280kb | OK | 5 |
6 | 4ms | 864kb | OK | 5 |
7 | 12ms | 1196kb | OK | 5 |
8 | 12ms | 1540kb | OK | 5 |
9 | 12ms | 1676kb | OK | 5 |
10 | 12ms | 1372kb | OK | 5 |
11 | 12ms | 1196kb | OK | 5 |
12 | 12ms | 1500kb | OK | 5 |
13 | 4ms | 740kb | OK | 5 |
14 | 4ms | 844kb | OK | 5 |
15 | 8ms | 1096kb | OK | 5 |
16 | 8ms | 1152kb | OK | 5 |
17 | 8ms | 1184kb | OK | 5 |
18 | 8ms | 1224kb | OK | 5 |
19 | 12ms | 1616kb | OK | 5 |
20 | 32ms | 2464kb | OK | 5 |
Punctaj total | 100 |