题目来源:
题目大意:
给出n个点,判断这n个点能组成几个正方形。
解题思路:
排序+二分查找。
枚举对角线的两个点,算出中点,再算出另外两个个对角线的点的坐标,带到原序列中查找是否有这样的点。因为枚举查找超时所以用二分,但一开始的序列不是顺序所以先用qsort排序。
由于查找过程中会出现重复,所以查找完毕之后要将结果/2。
PS:虽说一开始点是整数,但中点有可能不是整数所以整体用double计算,double数据的相等就不能用相等来判断而用精度值判断。
AC代码:
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define N 1010
#define M 2
#define eps 1e-9
typedef struct boor{
double x;
double y;
}BOOR;
int T;
BOOR coor[N];
int cmp(const void *a, const void *b)
{
BOOR *c = (BOOR *)a;
BOOR *d = (BOOR *)b;
if(c->x != d->x)
return c->x - d->x;
else
return c->y - d->y;
}
int Squares(double x, double y)
{
int l, r, mid;
l = 0, r = T-1;
while (l<=r)
{
mid = (l+r)/2;
if (fabs(coor[mid].x-x)<eps && fabs(coor[mid].y-y)<eps)
{
return 1;
}
else if ((coor[mid].x-x)>eps || (fabs(coor[mid].x-x)<eps && (coor[mid].y-y)>eps))
{
r = mid - 1;
}
else
{
l = mid + 1;
}
}
return 0;
}
int finds()
{
int i, j, c=0;
double x1, y1, x2, y2, x, y, xl, yl, xt1, xt2, yt1, yt2;
for (i=0;i<T;i++)
{
x1 = coor[i].x;
y1 = coor[i].y;
for (j=i+1;j<T;j++)
{
x2 = coor[j].x;
y2 = coor[j].y;
x = (x1+x2)/2.0;
y = (y1+y2)/2.0;
xl = x1-x;
yl = y1-y;
xt1 = x-yl;
yt1 = y+xl;
xt2 = x+yl;
yt2 = y-xl;
if (Squares(xt1,yt1) && Squares(xt2,yt2))
{
c++;
}
}
}
return c;
}
int main()
{
int i;
while (scanf("%d",&T) && T)
{
for (i=0;i<T;i++)
{
scanf("%lf %lf",&coor[i].x,&coor[i].y);
}
qsort(coor,T,sizeof(coor[0]),cmp);
printf("%d\n",finds()/2);
}
return 0;
}