cf1203B B. Equal Rectangles

B. Equal Rectangles
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given 4n sticks, the length of the i-th stick is ai.

You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length and all angles in it should be right. Note that each stick can be used in only one rectangle. Each stick should be used as a side, you cannot break the stick or use it not to the full length.

You want to all rectangles to have equal area. The area of the rectangle with sides a and b is a⋅b.

Your task is to say if it is possible to create exactly n rectangles of equal area or not.

You have to answer q independent queries.

Input
The first line of the input contains one integer q (1≤q≤500) — the number of queries. Then q queries follow.

The first line of the query contains one integer n (1≤n≤100) — the number of rectangles.

The second line of the query contains 4n integers a1,a2,…,a4n (1≤ai≤104), where ai is the length of the i-th stick.

Output
For each query print the answer to it. If it is impossible to create exactly n rectangles of equal area using given sticks, print “NO”. Otherwise print “YES”.

Example
input
5
1
1 1 10 10
2
10 5 2 10 1 1 2 5
2
10 5 1 10 5 1 1 1
2
1 1 1 1 1 1 1 1
1
10000 10000 10000 10000
output
YES
YES
NO
YES
YES
题意： 题意，给出4*n个数，问这些数能否组成n个矩形，使其面积相等，可以输出YES,否则输出NO。
思路： 要是其面积相等，那么最大 的边一定是和最小的组合，所以先对数组排序，从数组开头和末尾依次取出两个数，先判断其两两是否相等，相等则可以组成一个矩形，再计算面积，用set存面积，若出现面积不相同的，直接标记并跳出循环，详情看代码和注释。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4e2 + 10;
int a[N];
int main() {
	int t, n;
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		for (int i = 1; i <= 4 * n; i++) {
			scanf("%d", &a[i]);
		}
		sort(a + 1, a + 4 * n + 1);
		int i = 1, j = 4 * n;
		int flag = 0;
		set<int> s;
		while (i < j) {
			int x1 = a[i];
			i++;
			int x2 = a[i];
			i++;
			int y1 = a[j];
			j--;
			int y2 = a[j];
			j--;
			// 先判断能否组成矩形 
			if (x1 != x2 || y1 != y2) {
				flag = 1;
				break;
			}
			int sum = x1 * y1;
			s.insert(sum);
			if (s.size() > 1) { // 出现面积不相等，直接标记跳出 
				flag = 1;
				break;
			}
		}
		if (!flag) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}