暴力求包含n个点的圆的最小半径

排序 同时被 3 个专栏收录
14 篇文章 0 订阅
26 篇文章 0 订阅
4 篇文章 0 订阅

题目1 : The Cats' Feeding Spots

时间限制: 1000ms
单点时限: 1000ms
内存限制: 256MB

描述

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

让从m个点中任意取一个点作为圆心,画圆,使园内包含n个点(包括圆心),的圆半径最小.

并且圆边缘处不允许存在点


#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#define INF 0x3f3f3f3f
using namespace std;

struct node
{
    double x,y;
} p[200];
double arr[200];
int main()
{
    int T,i,j;
    int n,m;
    scanf("%d",&T);
    while(T--)
    {
        int min=INF;
        scanf("%d%d",&m,&n);
        for(i=0; i<m; i++)
        {
            scanf("%lf%lf",&p[i].x,&p[i].y);
        }
        if(n>m)
        {
            printf("-1\n");
            continue;
        }
        for(i=0; i<m; i++)
        {
            for(j=0; j<m; j++)
            {
                arr[j]=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y);
            }
            sort(arr,arr+m);   //距离排序
            
            double x=sqrt(arr[n-1]);  //第n个长的距离
            int y=(int)x;         
            double tt;
            double z=y;     
            z+=1;                //将半径化成double型
            if(n==m)             //特判
                tt=INF;
            else
                tt=sqrt(arr[n]);      //第n+1个长的距离
            if(tt<=z)             //  将半径与第n+1个长的距离进行比较
                continue;          //不符合
            else                   //符合
            {
                if(z<min)
                    min=z;
            }
        }
        if(min==INF)
            printf("-1\n");
        else
            printf("%d\n",min);
    }
    return 0;
}


  • 0
    点赞
  • 0
    评论
  • 0
    收藏
  • 一键三连
    一键三连
  • 扫一扫,分享海报

©️2021 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、C币套餐、付费专栏及课程。

余额充值