HDU 1007 Quoit Design (分治)
来源:互联网 发布:淘宝团购在哪里 编辑:程序博客网 时间:2024/06/05 05:29
Quoit Design
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
题目大意:
给你很多点,问你最近点的距离一半是多少。
解题思路:
最近点对,参照:http://blog.csdn.net/hellobabygogo3/article/details/8042650
解题代码:(参照它的思路,感觉我的代码比较简洁一些)
#include <iostream>#include <cstdio>#include <cmath>#include <vector>#include <algorithm>using namespace std;const int maxn=110000;struct point{ double x,y; double getdis(point p){ return sqrt( (x-p.x)*(x-p.x)+(y-p.y)*(y-p.y) ); } friend bool operator < (point a,point b){ if(a.x!=b.x) return a.x<b.x; else return a.y<b.y; }}p[maxn];int n;bool cmp(point a,point b){ if(a.y!=b.y) return a.y<b.y; else return a.x<b.x;}double getmin(int l,int r){ if(r-l==0) return 1e18; if(r-l==1) return p[l].getdis(p[r]); int mid=(l+r)/2; double ans=min( getmin(l,mid),getmin(mid+1,r) ); vector <point> v; for(int i=l;i<r;i++){ if( fabs(p[i].x-p[mid].x) < ans ) v.push_back(p[i]); } sort(v.begin(),v.end(),cmp); for(int i=0;i<v.size();i++){ for(int j=i+1;j<v.size();j++){ if(v[j].y-v[i].y>=ans) break; double tmp=v[j].getdis(v[i]); if(tmp<ans) ans=tmp; } } return ans;}void solve(){ double ans=1e18; sort(p,p+n); printf("%.2lf\n",getmin(0,n-1)/2.0);}int main(){ while(scanf("%d",&n)!=EOF && n>0){ for(int i=0;i<n;i++) scanf("%lf%lf",&p[i].x,&p[i].y); solve(); } return 0;}
4 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 (分治)
- Quoit Design - HDU 1007 分治
- 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竟然要分治
- poj 1007 Quoit Design(分治)
- Android之一Activity生命周期
- mongoDB学习
- CentOS从源码安装PostgreSQL
- UVa 10057 - A mid-summer night's dream.
- 杭电 2059 龟兔赛跑
- HDU 1007 Quoit Design (分治)
- Java 删除文件或文件夹
- ubuntu增加一块虚拟硬盘
- Java连接Oracle数据库的示例代码
- ICE中间件说明文档
- 14.2-平面面积OJ版
- 如何使用搜索技巧来成为一名高效的程序员
- iOS手动控制界面旋转
- fread函数和fwrite函数