rt WA on #7,#9,#10

//2023/4/8
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+10;
int num,ans;
int x[MAXN],y[MAXN];
int main()
{
	int x1,y1,x2,y2;
	long long max1=0,max2=0;
	cin>>x1>>y1>>x2>>y2;
	int n;
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		cin>>x[i]>>y[i];
	}
	for (int i=1;i<=n;i++)
	{
		long long l1=pow(x1-x[i],2)+pow(y1-y[i],2);
		long long l2=pow(x2-x[i],2)+pow(y2-y[i],2);
		cout<<l1<<" "<<l2<<endl;//观察该点到两个拦截系统的距离
		if(l1<=max1||l2<=max2)
		{
			continue;
		} 
		if(l1<l2)//若到1需要增加的距离较到2需要增加的距离较短 
		{
			max1=l1;
		}
		else
		{
			max2=l2;
		}
		cout<<max1<<endl<<max2<<endl;	
	}
	//
	long long maxn=max1+max2;
	cout<<maxn<<endl;
	return 0;
}