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;
}



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

相关文章推荐

HDU1007 Quoit Design(最近点对问题)

今天刚学的,参考了别人的思路,原文链接:http://blog.csdn.net/hellobabygogo3/article/details/8042650 先说下题意,很简单,给n个点的坐标,求距...

hdu1007 Quoit Design (分治+鸽舍原理)

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

hdu 1007最近点对

先说下题意,很简单,给n个点的坐标,求距离最近的一对点之间距离的一半。第一行是一个数n表示有n个点,接下来n行是n个点的x坐标和y坐标,实数。      这个题目其实就是求最近点对的距离。主要思...

杭电OJ——1007 Quoit Design(最近点对问题)

Quoit Design Problem Description Have you ever played quoit in a playground? Quoit is a game in w...

《Microsoft SQL Server 2008 Analysis Services Step by Step》学习笔记十七:管理分区及数据库处理(下)

SQL Server 2008中SQL应用系列及BI笔记系列--目录索引导读:本文介绍Analysis Services管理分区及数据库处理。本文将包括以下内容:■1、使用ROLAP或MOLAP存储配...

sem_open

4, 遇到的问题 (1) sem_open() 找不到文件或路径的问题 这是由于在内核中,创建信号量的默认路径是/dev/shm。当你要创建一个信号量/tmp/mysem时,实际上是创建了一个/d...

CodeVS天梯黄金

各种水题

【小结】树状数组的区间修改与区间查询

第一次听到树状数组是zsl来讲课QAQ 然后当时他给我们绕了很久 = = 嗯没懂…………结果后来发现这东西实际上是个简单又好用的玩意QAQ [ 1 ]  树状数组的本职是单点修改+区间查询 维护前...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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