HDU 1007 Quoit Design
来源:互联网 发布:mac装windows分区设置 编辑:程序博客网 时间:2024/05/20 17:08
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.
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
20 01 121 11 13-1.5 00 00 1.50
Sample Output
0.710.000.75
Author
CHEN, Yue
Source
ZJCPC2004
#include<iostream>#include<algorithm>#include<cmath>#include<cstdio>using namespace std;#define size 100001typedef 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;}
0 0
- hdu 1007 Quoit Design
- hdu 1007 Quoit Design
- hdu 1007 Quoit Design
- HDU-1007 Quoit Design
- hdu 1007 Quoit Design
- hdu 1007 Quoit Design
- hdu 1007 Quoit Design
- HDU 1007 Quoit Design
- HDU 1007 Quoit Design
- HDU 1007 Quoit Design
- hdu-1007-Quoit Design
- HDU 1007 Quoit Design
- hdu 1007 - Quoit Design
- hdu 1007 Quoit Design
- hdu 1007 Quoit Design
- HDU 1007 Quoit Design
- HDU 1007 Quoit Design
- hdu 1007 Quoit Design
- Servlet技术浅析(二)之HttpServlet抽象类
- JdbcTemplate简介
- jQuery实现图片左右出现和隐藏动画(腰封)
- Nginx的安装及简单配置
- Hive数据库及表的基本操作
- HDU 1007 Quoit Design
- Android 开发实战经验总结
- 分数化小数
- oracle导入导出命令
- Pandas入门
- 递推平均滤波
- 程序实训报告--歌手大奖赛计分程序
- Sublime 使用技巧
- lucene(4)——版本5.X写排序