hdu 1007 Quoit Design

Quoit Design

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 18291    Accepted Submission(s): 4713

Problem Description

Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a time. On the other hand, to make the game look more attractive, the ring is designed to have the largest radius. Given a configuration of the field, you are supposed to find the radius of such a ring.

Assume that all the toys are points on a plane. A point is encircled by the ring if the distance between the point and the center of the ring is strictly less than the radius of the ring. If two toys are placed at the same point, the radius of the ring is considered to be 0.

 

Input

The input consists of several test cases. For each case, the first line contains an integer N (2 <= N <= 100,000), the total number of toys in the field. Then N lines follow, each contains a pair of (x, y) which are the coordinates of a toy. The input is terminated by N = 0.

 

Output

For each test case, print in one line the radius of the ring required by the Cyberground manager, accurate up to 2 decimal places. 

 

Sample Input

  
  

   
   2
0 0
1 1
2
1 1
1 1
3
-1.5 0
0 0
0 1.5
0
  
  

 

Sample Output

  
  

   
   0.71
0.00
0.75
  
  

 

Author

CHEN, Yue

 

Source

ZJCPC2004

 

Recommend

JGShining

 

最近点对。。

题意：给你N个点，求这N个点中两点距离最近的那个值，直接暴力肯定会ＴＬＥ，所以思路是分治。

这题模板题，具体思路算法导论上３３章第四节５９１面上有，不解释了。。。

复杂度Ｏ（ｎｌｇｎ）

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
const int maxn=100005;
struct Point
{
    double x,y;
    int index;
};
Point a[maxn],b[maxn],c[maxn];
double dis(Point a,Point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int merge(Point p[],Point q[],int s,int m,int t)
{
    int i,j,k;
    for(i=s,j=m+1,k=s;i<=m&&j<=t;)
    {
        if(q[i].y>q[j].y) p[k++]=q[j],j++;
        else  p[k++]=q[i],i++;
    }
    while(i<=m) p[k++]=q[i++];
    while(j<=t) p[k++]=q[j++];
    memcpy(q+s,p+s,(t-s+1)*sizeof(p[0]));
    return 0;
}
double closest(Point a[],Point b[],Point c[],int p,int q)
{
    if(q-p==1) return dis(a[p],a[q]);
    else if(q-p==2)
    {
        double x1=dis(a[p],a[q]);
        double x2=dis(a[p+1],a[q]);
        double x3=dis(a[p],a[p+1]);
        if(x1<x2&&x1<x3) return x1;
        else if(x2<x3) return x2;
        else return x3;
    }
    int i,j,k,m=(p+q)/2;
    double d1,d2;
    for(i=p,j=p,k=m+1;i<=q;i++)
        if(b[i].index<=m)
            c[j++]=b[i];
        else
            c[k++]=b[i];
    d1=closest(a,c,b,p,m);
    d2=closest(a,c,b,m+1,q);
    double dm=min(d1,d2);
    merge(b,c,p,m,q);
    for(i=p;i<k;i++)
    for(j=i+1;j<k&&c[j].y-c[i].y<dm;j++)
    {
        double temp=dis(c[i],c[j]);
        if(temp<dm)
            dm=temp;
    }
    return dm;
}
bool cmp_x(Point a,Point b)
{
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}
bool cmp_y(Point a,Point b)
{
    if(a.y==b.y)
        return a.x<b.x;
    return a.y<b.y;
}
int main()
{
    int i,n;
    double d;
    while(scanf("%d",&n)!=EOF,n)
    {
        for(int i=0;i<n;i++)
            scanf("%lf%lf",&a[i].x,&a[i].y);
        sort(a,a+n,cmp_x);
        for(int i=0;i<n;i++)
            a[i].index=i;
        memcpy(b,a,n*sizeof(b[0]));
        sort(b,b+n,cmp_y);
        d=closest(a,b,c,0,n-1);
        printf("%.2lf\n",d/2.0);
    }
    return 0;
}