hihocoder #1227 : The Cats' Feeding Spots 北京赛区(2015)网络赛 (暴力枚举)
来源:互联网 发布:java 线程传递数据 编辑:程序博客网 时间:2024/04/30 11:04
#1227 : The Cats' Feeding Spots
- 样例输入
43 2 0 0 1 0 1.2 02 2 0 0 1 02 1 0 0 1.2 02 1 0 0 1 0
- 样例输出
121-1
描述
In Yan Yuan, the Peking University campus, there are many homeless cats. They all live happy lives because students founded a Cat Association to take care of them. Students not only feed them, but also treat their illness and sterilize some of them. Students make many feeding spots for the cats and cats always gather around those spots and make a lot of noise at night. Now the university authorities decide to restrict the number of feeding spots. This is the conversation between an officer and Rose Li, the director of Cat Association, and also a ACMer.
"Rose, From now on, you can't build any new feeding spots any more. But I want you to keep exactly N feeding spots, and you should make the area which contains the feeding spots as small as possible!"
"Oh, do you mean that we should find a smallest convex hull which contains N spots?"
"Convex hull? What is a convex hull? Please speak Chinese!"
"All right, forget the convex hull. So what do you mean the 'area', what's its shape?"
"It means... and the shape? Oh... let's do it this way: you can choose any feeding spot as center, and then draw a circle which includes exactly N spots. You should find the smallest circle of such kind, and then we remove all feeding spots outside that circle."
Although this way sounds a little bit ridiculous, Rose still writes a program to solve the problem. Can you write the program?
输入
The first line is an integer T (T <= 50), meaning the number of test cases.
Then T lines follow, each describing a test case.
For each test case:
Two integer M and N go first(1 <= M, N <= 100), meaning that there are M feeding spots originally and Rose Li has to keep exactly N spots.
Then M pairs of real numbers follow, each means a coordinate of a feeding spot in Yan Yuan. The range of coordinates is between [-1000,1000]
输出
For each test case, print the radius of the smallest circle. Please note that the radius must be an POSITIVE INTEGER and no feeding spots should be located just on the circle because it's hard for the campus gardeners to judge whether they are inside or outside the circle. If there are no solution, print "-1" instead.
代码:
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>using namespace std;int inf=1e9;#define eps 1e-8struct node{double x,y;}s[110];double dis[110][110];double dist(node a,node b){ return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));}int main(){int t;scanf("%d",&t);while(t--){int n,m;int ans=inf;memset(dis,0,sizeof(dis));scanf("%d%d",&m,&n);for(int i=1;i<=m;i++){scanf("%lf%lf",&s[i].x,&s[i].y);}if(n>m){puts("-1");continue;}for(int i=1;i<=m;i++){for(int j=1;j<=m;j++){dis[i][j]=dist(s[i],s[j]);}}for(int i=1;i<=m;i++){sort(dis[i]+1,dis[i]+m+1);int R=(int)ceil(dis[i][n]+eps);//int ans= R==dis[n]?:dis[n+1]:R;if(dis[i][n+1]-eps > R || n==m ) ans=min(ans,R);}if(ans==inf) printf("-1\n");else printf("%d\n",ans);}return 0;}
- hihocoder #1227 : The Cats' Feeding Spots 北京赛区(2015)网络赛 (暴力枚举)
- hihoCoder 1227 The Cats' Feeding Spots(暴力)——ACM-ICPC国际大学生程序设计竞赛北京赛区(2015)网络赛
- hihoCoder 1227 The Cats' Feeding Spots 2015北京赛区网络赛
- 北京赛区(2015)网络赛The Cats' Feeding Spots
- hihoCoder 1227 The Cats' Feeding Spots && ACM-ICPC国际大学生程序设计竞赛北京赛区(2015)网络赛
- hihocoder #1227 : The Cats' Feeding Spots(枚举)
- 1001 The Cats' Feeding Spots (2015年北京赛区网络赛A题)
- hihoCoder #1227 : The Cats' Feeding Spots
- hihoCoder 1227 The Cats' Feeding Spots(水)
- hihoCoder 1227 The Cats' Feeding Spots
- 【HIHOCODER】The Cats' Feeding Spots
- hihoCoder1227 The Cats' Feeding Spots【暴力】
- hiho1227--The Cats' Feeding Spots
- hihoCoder1227 The Cats' Feeding Spots 二分
- hihoCoder 1236 Scores(2015北京赛区网络赛)
- hihoCoder 1231 Border Length(北京赛区(2015)网络赛 E)
- Cats and Fish2017北京赛区网络同步赛
- 【2016-北京赛区网络赛-I】枚举,贪心,优先队列,优化(导弹,hihocoder 1391)
- 操作系统总结二
- 使用Spring Boot来加速Java web项目的开发
- C++顺序容器
- SEO-搜索引擎优化
- JavaScript 实现flappy bird小游戏
- hihocoder #1227 : The Cats' Feeding Spots 北京赛区(2015)网络赛 (暴力枚举)
- DOS各版本下载地址
- ZooKeeper中集群失效后Session问题
- 增量最小生成树 NEU 1132 Renew MST Quickly
- HDOJ 2485 Destroying the bus stations 最大流最小割
- 操作符重载强化训练2-自定义数组类
- JS+HTML+CSS 学习笔记
- BZOJ 1574: [Usaco2009 Jan]地震损坏Damage
- SpringMVC4+Spring4+Hibernate4框架整合