标签：
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.
样例输入
4 3 2 0 0 1 0 1.2 0 2 2 0 0 1 0 2 1 0 0 1.2 0 2 1 0 0 1 0
样例输出
1 2 1 -1
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <deque>
#include <cstring>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cstdlib>
#include <iomanip>
using namespace std;
typedef long long LL;
const LL INF = 0xfffffff;
const int maxn = 105;
const LL MOD = 1e9+7;
double len[maxn][maxn];
int m, n;
struct Point
{
double x, y;
}P[maxn];
double GetLen(int a,int b)
{
return sqrt( (P[a].x-P[b].x)*(P[a].x-P[b].x) + (P[a].y-P[b].y)*(P[a].y-P[b].y) );
}
int main()
{
int T;
scanf("%d", &T);
while(T--)
{
scanf("%d %d",&n, &m);
for(int i=0; i<n; i++)
scanf("%lf %lf", &P[i].x, &P[i].y);
for(int i=0; i<n; i++)
{
for(int j=i; j<n; j++)
{
len[i][j] = GetLen(i, j);
len[j][i] = len[i][j];
}
sort(len[i],len[i]+n);
}
int ans = INF;
int ok=0;
for(int i=0; i<n; i++)
{
int cnt = (int)(len[i][m-1])+1;
if(fabs(cnt-len[i][m]) > 1e-10)
ans = min(ans , cnt);
}
if(ans == INF)
printf("-1\n");
else
printf("%d\n", ans);
}
return 0;
}
标签：
原文地址：http://www.cnblogs.com/PersistFaith/p/4823336.html
