POJ1328贪心算法
来源:互联网 发布:网络舆情办理 编辑:程序博客网 时间:2024/06/04 18:29
Radar Installation
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 75702 Accepted: 16958
Description
Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius installation, if the distance between them is at most d.
We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.
Figure A Sample Input of Radar Installations
We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.
Figure A Sample Input of Radar Installations
Input
The input consists of several test cases. The first line of each case contains two integers n (1<=n<=1000) and d, where n is the number of islands in the sea and d is the distance of coverage of the radar installation. This is followed by n lines each containing two integers representing the coordinate of the position of each island. Then a blank line follows to separate the cases.
The input is terminated by a line containing pair of zeros
The input is terminated by a line containing pair of zeros
Output
For each test case output one line consisting of the test case number followed by the minimal number of radar installations needed. "-1" installation means no solution for that case.
Sample Input
3 21 2-3 12 11 20 20 0
Sample Output
Case 1: 2Case 2: 1开始自己也没想出来 ,直到看完题解才明白还可以再往回走。#include <iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;struct node{ double zuo; double you;}a[11234];bool cmp(node a,node b){ return a.zuo<b.zuo;}int main(){ int n; double d; int fl=1; while(cin>>n>>d) { int sum=1,flag=1; if(n==0&&d==0) break; for(int i=0;i<n;i++) { int x,y; scanf("%d%d",&x,&y); if(y>d||d<0) flag=0; a[i].you = x+sqrt(d*d-y*y); a[i].zuo= x-sqrt(d*d-y*y); } sort(a,a+n,cmp); double tt=a[0].you; for(int i=1;i<n;i++){ if(a[i].you <= tt){ tt = a[i].you; } else if(a[i].zuo > tt){ sum++; tt= a[i].you; } } if(flag==0) sum=-1; printf("Case %d: %d\n",fl,sum); fl++; } return 0;}
0 0
- 贪心算法 | Poj1328
- POJ1328贪心算法
- poj1328 贪心算法
- POJ1328 贪心算法
- poj1328/2109/2586 贪心算法
- POJ1328 -- 贪心算法和快速排序
- POJ1328---Radar Installation(贪心算法)
- POJ1328贪心
- POJ1328--贪心
- poj1328(贪心)
- poj1328 贪心
- poj1328 贪心
- poj1328 贪心
- poj1328贪心
- POJ1328(贪心)
- poj1328贪心
- poj1328 贪心
- POJ1328 贪心
- 2016多校联合第二场
- 看病要排队
- 04-树6 Complete Binary Search Tree
- iOS runloop 创建一个和App生命周期相同的线程
- 欢迎使用CSDN-markdown编辑器
- POJ1328贪心算法
- 我的Android进阶之旅------>解决Error:Unable to find method 'org.gradle.api.internal.project.ProjectInternal.g
- Educational Codeforces Round 13 E 状压dp
- 利用XShell上传、下载文件(使用sz与rz命令),超实用!
- CSS预处理技术总结(一)Less
- HDU1542——Atlantis(扫描线,线段树,矩形面积并,离散化)
- 个人主页
- RunLoop详解4
- 3、线程安全_synchronized