hdu 1007 Quoit Design
来源:互联网 发布:淘宝断码折扣店 编辑:程序博客网 时间:2024/05/20 01:36
Quoit Design
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10498 Accepted Submission(s): 2581
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
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;int n;struct Point{ double x,y;}p[100001];bool cmp(Point a,Point b){ if(a.x==b.x) { return a.y<b.y; } return a.x<b.x;}double dis(Point a,Point b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}double getMin(int i){ double d=999999,di=0; for(int j=i+1;j<n;j++) { di=dis(p[i],p[j]); if(d>di)d=di; else break; } return d;}int main(){ int i,j,k; double ans,f; while(scanf("%d",&n)!=EOF) { if(!n)break; for(i=0;i<n;i++) { scanf("%lf%lf",&p[i].x,&p[i].y); } sort(p,p+n,cmp); ans=999999; for(i=0;i<n-1;i++) { f=getMin(i); if(ans>f)ans=f; } printf("%.2lf\n",ans/2.0); } return 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
- 请描述下Activity的生命周期
- 正确才是硬道理?No,KISS!
- SQLServer 如何获取刚插入数据的Id号
- 2007-09-16频谱分析来着
- An open letter to those who want to start programming
- hdu 1007 Quoit Design
- 《浪潮之巅》有感
- 在Windows平台安装Perl运行环境
- 操作系统随想
- 15个Google面试题以及答案
- VxWorks任务编程中常见异常分析
- 16个经典面试问题回答思路
- 时钟
- 加载jquery库文件