L3-006 迎风一刀斩

 呜呼，写完真爽

#include <iostream>
#include <vector>
using namespace std;

struct Node {double x, y;};
int n, a;
void input(vector<Node>& arr) {
	cin >> a;
	arr.resize(a);
	for (int i = 0; i < a; i++) {
		cin >> arr[i].x >> arr[i].y;
	}
	return;
}
void slo_len(vector<Node>& a, vector<Node>& arr) {
	a.resize(arr.size());
	for (int i = 0; i < arr.size(); i++) {
		int j = (i + 1) % arr.size();
		double xx = abs(arr[i].x - arr[j].x);
		double yy = abs(arr[i].y - arr[j].y);
		a[i].x = min(xx, yy) / max(xx, yy);
		a[i].y = xx * xx + yy * yy;
	}
	return;
}
string check(vector<Node>& a1, vector<Node>& a2) {
	if (a1[0].y == a2[0].y || a1[0].y == a2[1].y || a1[1].y == a2[0].y || a1[1].y == a2[1].y) {
		return "YES";
	}
	return "NO";
}
int getxiebian(vector<Node>& a) {
	for (int i = 0; i < 4; i++) 
		if (a[i].x != 0) return i;
}
void initslo_len(vector<Node>& a, double& slo, double& len) {
	for (int i = 0; i < a.size(); i++) {
		if (a[i].x == 0) continue;
		if (slo != -1) {
			slo = -2;
			break;
		}
		slo = a[i].x, len = a[i].y;
	}
	return;
}
string fun(vector<Node>& arr1, vector<Node>& arr2) {
	vector<Node> a1, a2;
	slo_len(a1, arr1), slo_len(a2, arr2);
	double slo1 = -1, len1 = -1, slo2 = -1, len2 = -1;
	initslo_len(a1, slo1, len1), initslo_len(a2, slo2, len2);
	if (slo1 == -2 || slo2 == -2) return "NO";
	if (slo1 == slo2 && len1 == len2) {
		if (slo1 == -1) return check(a1, a2);
		if (a1.size() == 4 && a2.size() == 4) {
			int a = getxiebian(a1);
			int b = getxiebian(a2);
			if (a1[(a + 2) % 4].y == a2[(b + 2) % 4].y) return "YES";
			return "NO";
		}
		return "YES";
	}
	return "NO";
}
string solve(vector<Node>& arr1, vector<Node>& arr2) {
	int n1 = arr1.size(), n2 = arr2.size();
	if (n1 == 3 && (n2 == 3 || n2 == 4 || n2 == 5))	return fun(arr1, arr2);
	if (n1 == 4 && (n2 == 3 || n2 == 4)) return fun(arr1, arr2);
	if (n1 == 5 &&  n2 == 3) return fun(arr1, arr2);
	return "NO";
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		vector<Node> arr1, arr2;
		input(arr1);
		input(arr2);
		cout << solve(arr1, arr2) << endl;
	}
	return 0;
}