poj 3714 Raid

最新推荐文章于 2023-02-03 09:12:51 发布

深度抽象

最新推荐文章于 2023-02-03 09:12:51 发布

阅读量1.7k

点赞数 1

CC 4.0 BY-SA版权

分类专栏： ACM解题报告计算几何文章标签： distance system output each 64bit input

本文链接：https://blog.youkuaiyun.com/wwwzys/article/details/6841475

ACM解题报告计算几何专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一个算法问题，旨在找出特工与核能电站之间的最短距离。通过输入特工与电站的位置坐标，算法能够计算并输出最小距离。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Raid

Time Limit: 5000MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

[Submit] [Go Back] [Status]

Description

After successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire repelled the six waves of Union's attack. After several sleepless nights of thinking, Arthur, General of the Union, noticed that the only weakness of the defense system was its energy supply. The system was charged by N nuclear power stations and breaking down any of them would disable the system.

The general soon started a raid to the stations by N special agents who were paradroped into the stronghold. Unfortunately they failed to land at the expected positions due to the attack by the Empire Air Force. As an experienced general, Arthur soon realized that he needed to rearrange the plan. The first thing he wants to know now is that which agent is the nearest to any power station. Could you, the chief officer, help the general to calculate the minimum distance between an agent and a station?

Input

The first line is a integer T representing the number of test cases.
Each test case begins with an integer N (1 ≤ N ≤ 100000).
The next N lines describe the positions of the stations. Each line consists of two integers X (0 ≤ X ≤ 1000000000) and Y (0 ≤ Y ≤ 1000000000) indicating the positions of the station.
The next following N lines describe the positions of the agents. Each line consists of two integers X (0 ≤ X ≤ 1000000000) and Y (0 ≤ Y ≤ 1000000000) indicating the positions of the agent. 　

Output

For each test case output the minimum distance with precision of three decimal placed in a separate line.

Sample Input

Sample Output

1.414
0.000

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
struct Point
{
    double x,y;
    int tag;
}p[200001];
int n;
bool cmp(Point a,Point b)
{
    if(a.x==b.x)
    {
        return a.y<b.y;
    }
    return a.x<b.x;
}
double dis(Point a,Point b)
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double getMin(int i)
{
     double Min=9999999999,temp;
     for(int j=i+1;j<(n<<1);++j)
     {

         if(p[i].tag!=p[j].tag)
         {
             temp=dis(p[i],p[j]);
             if(Min>temp)Min=temp;
             else break;
         }
     }
     return Min;
}
int t;
int main()
{
    int i,j,k;
    double ans,temp;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0;i<n;++i)
        {
            scanf("%lf%lf",&p[i].x,&p[i].y);
            p[i].tag=0;
        }
        for(i=n;i<(n<<1);++i)
        {
            scanf("%lf%lf",&p[i].x,&p[i].y);
            p[i].tag=1;
        }
        sort(p,p+2*n,cmp);
        ans=9999999999;
        for(i=0;i<((n<<1)-1);++i)
        {
            temp=getMin(i);
            if(ans>temp)ans=temp;
        }
        printf("%.3lf\n",ans);
    }
    return 0;
}