Submission #19723060

---

Source Code Expand

#include <cstdio>
#include <algorithm>
using namespace std;

template <typename T>
void read(T &x) {
	T f=1;x=0;char s=getchar();
	while(s<'0'||s>'9') {if(s=='-') f=-1;s=getchar();}
	while(s>='0'&&s<='9') {x=(x<<3)+(x<<1)+(s^'0');s=getchar();}
	x *= f;
}

int T;

int main() {
	scanf("%d" , &T);
	while(T -- > 0) {
		int ax , ay , bx , by , cx , cy;
		read(ax),read(ay),read(bx),read(by),read(cx),read(cy);
		int hx , hy;
		if((ax == bx && ay == cy) || (ax == cx && ay == by)) hx = ax , hy = ay;
		if((ax == bx && by == cy) || (bx == cx && ay == by)) hx = bx , hy = by;
		if((cx == bx && ay == cy) || (ax == cx && by == cy)) hx = cx , hy = cy;
		int mx = min(ax , min(bx , cx)) , my = min(ay , min(by , cy));
		if(!hx && !hy && !mx && !my) {
			puts("0");
			continue;
		}
		if(hx >= 0 && hy >= 0) {
			int ans = max(abs(mx) , abs(my)) * 2;
			if(hx != mx || mx == my) ans ++;
			printf("%d\n" , ans);
		}
		else if(hx < 0 && hy >= 0){
			int ans = max(abs(mx) , abs(my)) * 2;
			if(mx + 1 == hx && my + 1 == hy) ans --;
			printf("%d\n" , ans);
		}
		else if(hx < 0 && hy < 0) {
			int ans = max(abs(mx) , abs(my)) * 2;
			if(hx == mx && mx != my) ans --;
			printf("%d\n" , ans);
		}
		else {
			int ans = max(abs(mx) , abs(my)) * 2;
			if(mx == hx && my + 1 == hy) ans --;
			printf("%d\n" , ans);
		}
	}
	return 0;
}

Submission Info

Judge Result