Submission #1107

#TimeUsernameProblemLanguageResultExecution timeMemory
1107hana5505백신 (KOI13_vaccine)C++98
13.68 / 24
1000 ms1280 KiB
#include<stdio.h>
int n,k,mi[101];
int ar[101][1001];
int same(int s,int e)
{
	int i,j,l,ll,t,tt,cnt=0;

	for(i=2;i<=n;i++){
		tt=0;
		for(j=1;j<=mi[i]-k+1;j++){
			t=1;
			for(l=j,ll=s;l<j+k,ll<=e;l++,ll++)
				if(ar[i][l]!=ar[1][ll]) t=0;
			if(t) tt=1;
			t=1;
			for(l=j,ll=e;l<j+k,ll>=s;l++,ll--)
				if(ar[i][l]!=ar[1][ll]) t=0;
			if(t) tt=1;
		}
		if(tt) cnt++;
	}
	if(cnt==n-1) return 1;
	return 0;
}
int main()
{
	int i,j;

	scanf("%d %d",&n,&k);

	for(i=1;i<=n;i++){
		scanf("%d",&mi[i]);
		for(j=1;j<=mi[i];j++)
			scanf("%d",&ar[i][j]);
	}

	for(i=1;i<=mi[1]-k+1;i++){
		if(same(i,i+k-1)) {printf("YES");return 0;}
	}
	printf("NO");
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...