43pts 求救

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e7+5;
char a[maxn];
char b[maxn];
int z[maxn];
int p[maxn];
int len1,len2;
int max(int a,int b)
{
	return a>b?a:b;
}
int min(int a,int b)
{
	return a<b?a:b;
}
void answer1()
{
	int l=0,r=0;
	z[0]=len2;
	ll ans=len2+1;
//	printf("ans: %lld\n",ans);
	for(int i=1;i<len2;i++)
	{
	//	printf("l: %d r: %d\n",l,r);
	//	printf("(pre) z[%d]: %d]\n",i-l,z[i-l]);
		if(i<=r&&z[i-l]<r-i+1)
		{
			z[i]=z[i-l];
//			printf("(1) z[%d]: %d\n",i,z[i]);
		}
		else
		{
			z[i]=max(0,r-i+1);
      //   	printf("(sp) z[%d]: %d\n",i,z[i]); 
			while(b[i+z[i]]==b[z[i]]&&i+z[i]<len2)z[i]++;
//			printf("(2) z[%d]: %d\n",i,z[i]);
		}
		if(i+z[i]-1>r)
		{
			r=i+z[i]-1;
			l=i;
		}
		ans^=ll(i+1)*ll(z[i]+1);
	}
	printf("%lld\n",ans);
}
void answer2()
{
	ll ans=0;
	int l=0,r=0;
	while(a[p[0]]==b[p[0]])p[0]++;
	ans^=p[0]+1;
	for(int i=1;i<len1;i++)
	{
		if(i<=r&&p[i-l]<r-i+1)
		{
			p[i]=p[i-l];
		}
		else
		{
	//		printf("this\n");
			p[i]=max(0,r-i+1);
			while(a[i+p[i]]==b[p[i]]&&i+p[i]<len1&&p[i]<len2)p[i]++;
		}
		if(i+p[i]-1>r)
		{
			r=i+p[i]-1;
			l=i;
		}
		ans^=ll(i+1)*ll(p[i]+1);
//		printf("p[%d]: %d\n",i,p[i]);
	}
	printf("%lld",ans);
}
int main()
{
	scanf("%s",a);
	scanf("%s",b);
	len1=strlen(a);
	len2=strlen(b);
	answer1();
	answer2();
	return 0;
}