Goat on a Rope Gym - 101982G

 https://cn.vjudge.net/problem/Gym-101982G

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-3
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int N=2e6+9;
const int M=4e5+9;

double dis(double x,double y,double x1,double y1)
{
    return sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1));
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    double x,y,x1,x2,y1,y2;
    double ans=0;
    cin>>x>>y>>x1>>y1>>x2>>y2;
    double xx=min(x1,x2);
    double xxx=max(x1,x2);
    x1=xx;
    x2=xxx;
    double yy=min(y1,y2);
    double yyy=max(y1,y2);
    y1=yy;
    y2=yyy;
    if(x<=x1)
    {
        if(y<=y2&&y>=y1)
        {
            ans=(x1-x);
        }
        else if(y<=y1)
        {
            ans=dis(x,y,x1,y1);
        }
        else ans=dis(x,y,x1,y2);
    }
    else if(x>=x2)
    {
        if(y<=y2&&y>=y1)
        {
            ans=(x-x2);
        }
        else if(y<=y1)
        {
            ans=dis(x,y,x2,y1);
        }
        else ans=dis(x,y,x2,y2);
    }
    else
    {
        if(y>=y2)
        {
            ans=(y-y2);
        }
        else ans=(y1-y);
    }
    printf("%.3lf\n",ans);
    return 0;
}

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-3
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int N=2e6+9;
const int M=4e5+9;

double dis(double x,double y,double x1,double y1)
{
    return sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1));
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    double x,y,x1,x2,y1,y2;
    while(cin>>x>>y>>x1>>y1>>x2>>y2)
    {
        double ans=1e18;

        if(x1<=x&&x2>=x) ans=min(ans,min(fabs(y-y1),fabs(y-y2)));
        if(y1<=y&&y2>=y) ans=min(ans,min(fabs(x-x1),fabs(x-x2)));
        ans=min(ans,dis(x,y,x1,y1));
        ans=min(ans,dis(x,y,x1,y2));
        ans=min(ans,dis(x,y,x2,y1));
        ans=min(ans,dis(x,y,x2,y2));
        printf("%.3lf\n",ans);
    }

    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值