Submission #15099

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15099	2015-07-11T10:20:49 Z	ggoh	씽크스몰 (kriii3_TT)	C++	10 / 30	10000 ms	32332 KB

tt

#include<cstdio>
long long n,m,i,j,s;
long long a[1000002],b[1000002],c[2000002];
main()
{
	scanf("%lld%lld",&n,&m);
	for(i=0;i<=n;i++)
	{
		scanf("%lld",&a[i]);
	}
	for(j=0;j<=m;j++)
	{
		scanf("%lld",&b[j]);
	}
	for(i=0;i<=n;i++)
	{
		for(j=0;j<=m;j++)
		{
			c[i+j]+=a[i]*b[j];
		}
	}
	s=c[0];
	for(i=1;i<=n+m;i++)
	{
		s^=c[i];
	}
	printf("%lld",s);
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	32332 KB	Output is correct
2	Correct	0 ms	32332 KB	Output is correct
3	Correct	0 ms	32332 KB	Output is correct
4	Correct	0 ms	32332 KB	Output is correct
5	Correct	2 ms	32332 KB	Output is correct
6	Correct	2 ms	32332 KB	Output is correct
7	Correct	2 ms	32332 KB	Output is correct
8	Correct	0 ms	32332 KB	Output is correct

Subtask #2

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	166 ms	32332 KB	Output is correct
2	Correct	1455 ms	32332 KB	Output is correct
3	Correct	3951 ms	32332 KB	Output is correct
4	Correct	9575 ms	32332 KB	Output is correct
5	Execution timed out	10000 ms	32328 KB	Program timed out
6	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Halted	0 ms	0 KB	-