Submission #1122

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122		jiws829	백신 (KOI13_vaccine)	C++98	24 / 24	329 ms	1280 KiB

vaccine

#include<stdio.h>
int n,m;
int num[101];
int p[101][1001];
int check(int a,int b)
{
	int i,j,k;
	int r;
	
	for(i=3;i<=n;i++)
	{
		r=0;
		for(j=1;j<=num[i];j++)
		{
			if(p[1][a]==p[i][j])
			{
				for(k=0;;k++)
				{
					if(p[1][a+k]!=p[i][j+k] || a+k>num[1] || j+k>num[i]) break;
				}
				if(k>m) {r=1;break;}
				
				for(k=0;;k++)
				{
					if(p[1][a+k]!=p[i][j-k] || a+k>num[1] || j-k<1) break;
				}
				if(k>m) {r=1;break;}
			}
		}
		if(r==0) return 0;
	}
	return 1;
}
int main()
{
	scanf("%d %d",&n,&m);
	
	int i,j,k,r;
	
	for(i=1;i<=n;i++)
	{
		scanf("%d",&num[i]);
		for(j=1;j<=num[i];j++)
		{
			scanf("%d",&p[i][j]);
		}
	}
	
	for(i=1;i<=num[1];i++)
	{
		for(j=1;j<=num[2];j++)
		{
			if(p[1][i]==p[2][j])
			{
				for(k=0;;k++)
				{
					if(p[1][i+k]!=p[2][j+k] || i+k>num[1] || j+k>num[2]) break;
				}
				if(k>=m)
				{
					r=check(i,k);
					if(r) break;
				}
				
				for(k=0;;k++)
				{
					if(p[1][i+k]!=p[2][j-k] || i+k>num[1] || j-k<1) break;
				}
				if(k>=m)
				{
					r=check(i,k);
					if(r) break;
				}
			}
		}
		if(r) break;
	}
	if(r) printf("YES");
	else printf("NO");
}

• Subtask 1: 2.64 / 2.64
• Subtask 2: 3.12 / 3.12
• Subtask 3: 3.6 / 3.6
• Subtask 4: 4.32 / 4.32
• Subtask 5: 4.8 / 4.8
• Subtask 6: 5.52 / 5.52