题意
给你两个正方形,问两个正方形是否相交(有一个点相交就算)?第二个正方形为45°摆放,顺时针或逆时针输入这两个正方形的四个顶点的坐标。
思路
因为一个正方形内最多有100*100个点,我们把两个正方形的点都放入到set中,然后比较,如果有一个相同那么证明有交点。第一个正方形好处理直接X从min~max,Y从min~max即可。第二个我们从某个对角线往两边模拟就好了。
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int X1, Y1, X2, Y2, x, y;
set<pair<int, int> > a, b;
int main()
{
X1 = Y1 = INF; X2 = Y2 = -INF;
for (int i = 0; i < 4; i++)
{
scanf("%d%d", &x, &y);
X1 = min(X1, x); X2 = max(X2, x);
Y1 = min(Y1, y); Y2 = max(Y2, y);
}
for (int i = X1; i <= X2; i++)
{
for (int j = Y1; j <= Y2; j++)
{
a.insert(make_pair(i, j));
}
}
X1 = Y1 = INF; X2 = Y2 = -INF;
for (int i = 0; i < 4; i++)
{
scanf("%d%d", &x, &y);
X1 = min(X1, x); X2 = max(X2, x);
Y1 = min(Y1, y); Y2 = max(Y2, y);
}
int mid = (X1+X2)/2;//对角线的x坐标
for (int i = 0; i <= X2-mid; i++)
{
for (int j = Y1; j <= Y2; j++)
{
b.insert(make_pair(mid-i, j));
b.insert(make_pair(mid+i, j));
}
Y1++; Y2--;
}
bool flag = false;
for (auto i: a)
{
for (auto j: b)
{
if (i == j) { flag = true; break; }
}
if (flag) break;
}
if (flag) printf("YES\n");
else printf("NO\n");
return 0;
}
/*
0 0 6 0 6 6 0 6
1 3 3 5 5 3 3 1
*/