HDU 1007 Quoit Design

原创 2017年01月03日 16:45:52

Quoit Design
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 49579    Accepted Submission(s): 13043


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

 

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
#define size 100001
typedef struct
{
	double x,y;
}mypoint;

mypoint a[size];

double min(double a,double b)
{
	return a<b?a:b;
}

bool cmp(mypoint a,mypoint b)
{
	return a.y<b.y;
}

double dis(mypoint a,mypoint b)
{
	return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));
}


double divide(int left,int right)
{
	int middle=(left+right)/2;
	if(left+1==right) return dis(a[left],a[right]);
	if(left+2==right) return min(dis(a[left],a[left+1]),min(dis(a[left],a[right]),dis(a[left+1],a[right])));
	double min1,min2;
	min1=min(divide(left,middle),divide(middle+1,right));
	for(int i=left;i<=middle;i++)
	{
		for(int j=middle+1;j<=right;j++)
		{
			if((a[j].y-a[i].y)>min1) break;//跳过Y系
			if(fabs(a[j].x-a[i].x)>min1) continue;//跳过某Y下的X系
			min2=dis(a[i],a[j]);
			min1=min(min1,min2);
		}
	}
	return min1;
}

int main()
{
	int n;
	while(cin>>n&&n!=0)
	{
		for(int i=0;i<n;i++)
		{
			cin>>a[i].x>>a[i].y;
		}
		sort(a,a+n,cmp);
		printf("%.2lf\n",divide(0,n-1)/2);
	}
	return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

HDOJ 1007 Quoit Design(最近点对)

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

HDU 1007 Quoit Design(计算几何 平面最近点对)

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

hdu 1007 Quoit Design(借鉴大神,求解平面对点)

Quoit Design Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...
  • DW_css
  • DW_css
  • 2017年12月02日 17:12
  • 16

hdu 1007 Quoit Design 最近点对(分治)

题意:给定一个整数n,以及n个x

分治法-hdu_1007_Quoit Design

题目链接:点击打开链接 题目描述: Quoit Design Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/327...

hdu 1007 Quoit Design 最近点对

一道题目,最近点对的模版题。

hdu1007 Quoit Design(最近点对模板题)

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

hdu 1007 Quoit Design(分治法求最近点对)

大致题意:给N个点,求最近点对的距离 d ;输出:r = d/2。 // Time 2093 ms; Memory 1812 K #include #include #include #includ...

HDU 1007 Quoit Design 分治法

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

HDU 1007 Quoit Design(分治)

题目链接:点击打开链接 思路: 经典的分治法, 网上讲解很多我就不多说了, 这是nlognlogn复杂度, 大多数情况是够用的。。优化了一下排序函数, 跑了780ms 细节参见代码: #inc...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1007 Quoit Design
举报原因:
原因补充:

(最多只允许输入30个字)