Submission #19724513

---

Source Code Expand

#include <cstdio>
#include <algorithm>
using namespace std;
int Abs(int x){return x>0?x:-x;}
int main() {
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int ax,ay,bx,by,cx,cy,X,Y,sx=-1,sy=-1,ans=-1;
		scanf("%d %d %d %d %d %d",&ax,&ay,&bx,&by,&cx,&cy);
		X=min(ax,min(bx,cx));Y=min(ay,min(by,cy));
		sx+=Abs(X-ax)+Abs(X-bx)+Abs(X-cx);
		sy+=Abs(Y-ay)+Abs(Y-by)+Abs(Y-cy);
		ans=max(Abs(X*2+sx),Abs(Y*2+sy));
		if(Abs(X*2+sx)==Abs(Y*2+sy)&&Abs(X*2+sx)>=2) ans++;
		printf("%d\n",ans);
	}
	return 0;
}

Submission Info

Judge Result