习题5-6 对称轴（Symmetry，ACM/ICPC Seoul 2004，UVa1595）

原题链接：https://vjudge.net/problem/UVA-1595
分类：<map>
备注：水题

代码如下：

#include<algorithm>
#include<cstdio>
#include<vector>
#include<map>
using namespace std;
const int inf = 0x3f3f3f3f;
typedef pair<int, int> PII;
int main(void)
{
	int T, N, x, y;
	scanf("%d", &T);
	while (T--)
	{
		int maxl = inf, maxr = -inf, flag = 1;
		map<PII, int>buf;
		vector<PII>dot;
		scanf("%d", &N);
		while (N--)
		{
			scanf("%d%d", &x, &y);
			maxl = min(maxl, x);
			maxr = max(maxr, x);
			buf[PII(x, y)] = 1;
			dot.push_back(PII(x, y));
		}
		int double_axis = maxl + maxr;
		for (int i = 0; i < dot.size(); i++)
		{
			int a = dot[i].first, b = dot[i].second;
			int a2 = double_axis - a;
			if (!buf.count(PII(a2, b)))
			{
				flag = 0;
				break;
			}
		}
		if (flag)printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}