lightoj1240:Point Segment Distance (3D)(三分)

1240 - Point Segment Distance (3D)
Time Limit: 2 second(s)Memory Limit: 32 MB

Given a segment in 3D space, identified by A(x1, y1, z1), B(x2, y2, z2) and another point P(x, y, z) your task is to find the minimum possible Euclidean distance between the point P and the segment AB.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case starts with a line containing nine integers x1, y1, z1, x2, y2, z2, x, y, z. The magnitude of any integer will not be greater than 100.

Output

For each case, print the case number and the distance. Errors less than 10-6 will be ignored.

Sample Input

Output for Sample Input

2

0 0 1 0 1 1 0 1 0

0 0 0 1 1 1 0 0 1

Case 1: 1

Case 2: 0.8164965809

 


PROBLEM SETTER: JANE ALAM JAN

题意:求点到线段的最短距离。

思路:距离变化为凸函数,可以用三分法解决。

# include <iostream>
# include <cstdio>
# include <cmath>
# include <vector>
# include <cstring>
# include <algorithm>
using namespace std;
double fun(double x, double y, double z, double a, double b, double c)
{
    return sqrt((x-a)*(x-a)+(y-b)*(y-b)+(z-c)*(z-c));
}
int main()
{
    int t, cas=1;
    double x1, y1, z1, x2, y2, z2, x, y, z;
    scanf("%d",&t);
    while(t--)
    {
        int k=100;
        scanf("%lf%lf%lf%lf%lf%lf%lf%lf%lf",&x1, &y1, &z1, &x2, &y2,&z2,&x, &y, &z);
        double lx=x1, ly=y1,lz=z1, rx=x2,ry=y2,rz=z2, midx, midy, midz;
        while(k--)
        {
            midx=(lx+rx)/2; midy=(ly+ry)/2; midz=(lz+rz)/2;
            double s1 = fun(midx, midy, midz, x, y, z);
            double mmidx=(midx+rx)/2, mmidy=(midy+ry)/2, mmidz=(midz+rz)/2;
            double s2 = fun(mmidx, mmidy, mmidz, x, y, z);
            if(s2 > s1)
            {
                rx = mmidx;
                ry = mmidy;
                rz = mmidz;
            }
            else
            {
                lx = midx;
                ly = midy;
                lz = midz;
            }
        }
        printf("Case %d: ",cas++);
        printf("%.10f\n", fun(midx, midy, midz, x, y, z));
    }
    return 0;
}


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Sigma函数是指一个数字的所有因子之和。给定一个数字n,需要求出有多少个数字的Sigma函数是偶数。\[2\] 为了解决这个问题,可以先筛选出n范围内的素数(范围在10^6即可),然后对n进行素因子分解。对于每个因子,如果它的Sigma函数中连乘的每一项都是偶数,那么整个Sigma函数就是偶数。具体实现中,可以判断每个因子的平方根是否为偶数,如果是偶数,则减去(平方根+1)/2。\[1\] 另外,还可以使用O(1)的做法来解决这个问题。根据观察,所有的完全平方数及其两倍的值都会导致Sigma函数为偶数。因此,可以直接计算n的平方根,然后减去(平方根+1)/2即可得到结果。\[3\] #### 引用[.reference_title] - *1* [Sigma Function](https://blog.csdn.net/PNAN222/article/details/50938232)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control_2,239^v3^insert_chatgpt"}} ] [.reference_item] - *2* *3* [【LightOJ1336】Sigma Function(数论)](https://blog.csdn.net/qq_30974369/article/details/79009498)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control_2,239^v3^insert_chatgpt"}} ] [.reference_item] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值