This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int a[110][1010],l[110],p[1010],pi[1010],chk[1010],k;
void ff(){
int i=0,j=-1;
pi[0]=-1;
while(i<k){
if(j<0||p[i]==p[j])++i,++j,pi[i]=j;
else j=pi[j];
}
}
int kmp(int n){
int i=0,j=-1;
while(i<l[n]){
if(j<0||a[n][i]==p[j])++i,++j;
else j=pi[j];
if(j>=k)return 1;
}
return 0;
}
int main(){
int i,j,n,s;
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i){
scanf("%d",l+i);
for(j=0;j<l[i];++j)scanf("%d",a[i]+j);
}
for(i=0;i<l[1]-k;++i){
for(j=0;j<k;++j)p[j]=a[1][i+j];
ff();
s=1;
for(j=2;j<=n;++j)chk[j]=0;
for(j=2;j<=n;++j)if(kmp(j))++s,chk[j]=1;
for(j=0;j<k;++j)p[k-j-1]=a[1][i+j];
ff();
for(j=2;j<=n;++j)if(!chk[j]&&kmp(j))++s;
if(s==n)break;
}
if(i<l[1]-k)puts("YES");
else puts("NO");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |